254 search results - page 24 / 51 » Simplified Voronoi Diagrams |
CORR
2008
Springer
14 years 12 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...
100
click to vote
DCG
2010
14 years 12 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...
COMPGEOM
2007
ACM
15 years 3 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...
VIS
2004
IEEE
16 years 29 days ago
2004
IEEE
A new method for the simplification and the visualization of vector fields is presented based on the notion of Centroidal Voronoi tessellations (CVT's). A CVT is a special Vo...
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...