3 search results - page 1 / 1 » Sweep algorithms for constructing higher-dimensional constra... |
COMPGEOM
2000
ACM
13 years 8 months ago
2000
ACM
COMPGEOM
2003
ACM
13 years 9 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...
DCG
2008
13 years 4 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...