A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Algorithmic geometry
A generic software design for Delaunay refinement meshing
Computational Geometry: Theory and Applications
A slicing algorithm of point cloud for rapid prototyping
Proceedings of the 2007 Summer Computer Simulation Conference
Boundary recovery for Delaunay tetrahedral meshes using local topological transformations
Finite Elements in Analysis and Design
Hi-index | 0.00 |
We describe an algorithm which, for any piecewise linear complex (PLC) in 3D, builds a Delaunay triangulation conforming to this PLC. The algorithm has been implemented, and yields in practice a relatively small number of Steiner points due to the fact that it adapts to the local geometry of the PLC. It is, to our knowledge, the first practical algorithm devoted to this problem.