Computational geometry: an introduction
Computational geometry: an introduction
Implementing Watson's algorithm in three dimensions
SCG '86 Proceedings of the second annual symposium on Computational geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Higher-dimensional Voronoi diagrams in linear expected time
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Delaunay triangulations in three dimensions with finite precision arithmetic
Computer Aided Geometric Design
Computational geometry in C
Delaunay Triangulation Using a Uniform Grid
IEEE Computer Graphics and Applications
Autoscan: A Flexible and Portable 3D Scanner
IEEE Computer Graphics and Applications
An interactive modification data structure for 3D surfaces
Machine Graphics & Vision International Journal
Tetrahedralization of Point Sets Using Expanding Spheres
IEEE Transactions on Visualization and Computer Graphics
Computer Methods and Programs in Biomedicine
Mesh simplification using the edge attributes
EURASIP Journal on Applied Signal Processing
3-Dimensional minimum energy broadcasting problem
Ad Hoc Networks
Advanced STEP parameterised and constrained features for reverse engineering
International Journal of Computer Applications in Technology
CW complexes: topological mainframe for numerical representations of objects
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Edge-based approach to mesh simplification
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
The delaunay triangulation by grid subdivision
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Hole filling of triangular mesh segments using systematic grey prediction
Computer-Aided Design
| Hi-index | 0.00 |
A direct algorithm for computing the Delaunay triangulation in three dimensions is presented. The algorithm uses a 3D cell data structure to preprocess the data, a range searching procedure to find Delaunay points quickly, and a shelling mechanism to put tetrahedra together in such a way that completeness and correctness are guaranteed. A face and an edge lists are used to govern the triangulation process. The convex hull can also be computed at no extra cost.