215 search results - page 17 / 43 » Farthest-Polygon Voronoi Diagrams |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
DCG
2010
13 years 7 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
We test the hypothesis that cell membranes in early seaurchin embryos can be modeled as a Voronoi diagram from nuclei centers. In order to obtain a model of the cell geometry agai...
ISVD
2007
IEEE
14 years 1 months ago
2007
IEEE
Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagra...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...