tags:

views:

48

answers:

0
Q: 

Is it possible to generalize a Voronoi diagram into a k-means cluster?

In a n-dimensional Euclidean metric space, given a Voronoi decomposition for a set of S points (computed with Bowyer-Watson algorithm), is it possible to generalize k (with k<S) geometric clusters by converging multiple Dirichlet domains?

related questions

Compute the Centroid of a 3D Planar Polygon
Get the Area of a 3D surface
Fastest way to get the set of convex polygons formed by Voronoi line segments
Find the biggest rectangular area consisting only of 2 types of letter in a given MxN board.
Mesh Grid Simplification
General Polygon Clipper: Triangulate without additional vertices
General Polygon Clipper: Attach data to vertex
latitude/longitude find nearest latitude/longitude - complex sql or complex calculation!
Convex hull of 4 points.
CGAL 3.4: How do I get end vertex co-ordinates from a Finite_edges_iterator?
How do I solve an arithmetic sequence?
Computational Geometry open source lib
simple 2d collision problem
How do I iterate over faces in CGAL
Where can I find line buffering code?
Perpendicular on a line from a given point
Generate new polygons from a cut polygon (2D)
Solving for optimal alignment of 3d polygonal mesh
Triangulated Irregular Networks from qhull
Shortest distance between points algorithm
C++ 2D tessellation library?
An algorithm for inflating/deflating (offsetting, buffering) polygons
Find medial axis of a polygon using C#
How to determine if a Delaunay triangle is internal or external?
Algorithm to compute a Voronoi diagram on a sphere?