459 search results - page 10 / 92 » Delaunay mesh construction |
120
click to vote
SMA
1995
ACM
15 years 3 months ago
1995
ACM
This paper presents a new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries. T...
128
click to vote
SMA
2009
ACM
15 years 6 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
116
click to vote
COMPGEOM
2003
ACM
15 years 5 months ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
