Sciweavers

2 search results - page 1 / 1
» Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedr...
Sort
View
ICCSA
2005
Springer
13 years 10 months ago
Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization
We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions...
Hugo Ledoux, Christopher M. Gold, George Baciu
CPHYSICS
2004
93views more  CPHYSICS 2004»
13 years 4 months ago
Kinetic and dynamic Delaunay tetrahedralizations in three dimensions
We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only go...
Gernot Schaller, Michael Meyer-Hermann