Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Edge-Weighted Centroidal Voronoi Tessellations
View through CrossRef
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.
Global Science Press
Title: Edge-Weighted Centroidal Voronoi Tessellations
Description:
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.
Related Results
2D Centroidal Voronoi Tessellations with Constraints
2D Centroidal Voronoi Tessellations with Constraints
We tackle the problem of constructing 2D centroidal Voronoi tessellations
with constraints through an efficient and robust construction of bounded Voronoi diagrams,
the pseudo-dual...
Random Laguerre tessellations
Random Laguerre tessellations
A systematic study of random Laguerre tessellations, weighted generalisations of the well-known Voronoi tessellations, is presented. We prove that every normal tessellation with co...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
Modified Voronoi Diagram and Algorithms for its Application in Practice
Modified Voronoi Diagram and Algorithms for its Application in Practice
The scope of application of the Voronoi diagram is quite diverse: artificial intelligence, urban systems, marketing, computer science and others. This is because the so-called spat...
FINITE ELEMENT ANALYSIS OF QUASI-STATIC CRUSH ENERGY IN CLOSED CELL ALUMINUM FOAM USING VORONOI TESSELLATION
FINITE ELEMENT ANALYSIS OF QUASI-STATIC CRUSH ENERGY IN CLOSED CELL ALUMINUM FOAM USING VORONOI TESSELLATION
A novel Voronoi closed-cell foam model was developed to perform finite element analysis (FEA) to accurately capture the stress-strain behaviors exhibited by real foam blocks under ...
Voronoi Centerline-Based Seamline Network Generation Method
Voronoi Centerline-Based Seamline Network Generation Method
Seamline network generation is a crucial step in mosaicking multiple orthoimages. It determines the topological and mosaic contribution area for each orthoimage. Previous methods, ...
The Geodesic Edge Center of a Simple Polygon
The Geodesic Edge Center of a Simple Polygon
Abstract
The geodesic edge center of a simple polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, wher...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...