Edge-weighted centroidal Voronoi tessellations

2Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Most existing applications of centroidal Voronoi tessellations (CVTs) lack consideration of the length of the cluster boundaries. In this paper we propose a new model and algorithms to produce segmentations which would minimize the total energy - a sum of the classic CVT energy and the weighted length of cluster boundaries. To distinguish it with the classic CVTs, we call it an Edge-Weighted CVT (EWCVT). The concept of EWCVT is expected to build a mathematical base for all CVT related data classifications with requirement of smoothness of the cluster boundaries. The EWCVT method is easy in implementation, fast in computation, and natural for any number of clusters. © 2010 Global-Science Press.

Cite

CITATION STYLE

APA

Wang, J., & Wang, X. (2010). Edge-weighted centroidal Voronoi tessellations. Numerical Mathematics, 3(2), 223–244. https://doi.org/10.4208/nmtma.2010.32s.7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free