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
On Non-Poissonian Voronoi Tessellations
On Non-Poissonian Voronoi Tessellations
<p>The Voronoi tessellation is the partition of space for a given seeds pattern and the result of the partition depends completely on the type of given pattern ”random”, Pois...
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...
Tessellations de Voronoï généralisées : modélisation CAO, propriétés statistiques et application à l'homogénéisation du comportement des agrégats polycristallins
Tessellations de Voronoï généralisées : modélisation CAO, propriétés statistiques et application à l'homogénéisation du comportement des agrégats polycristallins
De nombreux matériaux hétérogènes peuvent voir leur architecture représentée géométriquement au moyen de Diagrammes De Voronoi (DDV). Les agrégats polycristallins en particulier so...
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...
Optimizing edge cloud deployments for video analytics
Optimizing edge cloud deployments for video analytics
(English) As our digital world and physical realities blend together, we, as users, are growing to expect real-time interaction wherever and whenever we want. Newer internet servic...
AI-driven zero-touch orchestration of edge-cloud services
AI-driven zero-touch orchestration of edge-cloud services
(English) 6G networks demand orchestration systems capable of managing thousands of distributed microservices under sub-millisecond latency constraints. Traditional centralized app...
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...