221 search results - page 24 / 45 » Rounding Voronoi diagram |
170
click to vote
DCG
2010
15 years 6 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...
169
click to vote
COMPGEOM
2007
ACM
15 years 10 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...
146
click to vote
ISPD
2000
ACM
15 years 10 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...
154
click to vote
AAIM
2009
Springer
16 years 21 days ago
2009
Springer
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
128
click to vote
SIBGRAPI
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an algorithm that creates a mosaic effect for an image in an adaptive and automatic fashion. The algorithm is automatic because it does not need user intervention, exce...