100
click to vote
CG
2005
Springer
14 years 8 months ago
2005
Springer
An unstructured tetrahedral mesh generation algorithm for 3D model with constraints is presented. To automatically generate a tetrahedral mesh for model with constraints, an advan...
GISCIENCE
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
96
Voted
SODA
2000
ACM
14 years 10 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
ICCSA
2005
Springer
15 years 2 months ago
2005
Springer
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...
COMPGEOM
2006
ACM
15 years 2 months ago
2006
ACM
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
CVPR
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...