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 point-placement strategy for conforming Delaunay tetrahedralization
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling and meshing a surface with guaranteed topology and geometry
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Quality meshing for polyhedra with small angles
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometry—SoCG2002
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
Variational tetrahedral meshing
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Delaunay refinement for piecewise smooth complexes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating polyhedral objects with deformable smooth surfaces
Computational Geometry: Theory and Applications
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Constrained Delaunay tetrahedral mesh generation and refinement
Finite Elements in Analysis and Design
A hybrid approach for computing visual hulls of complex objects
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Adaptive skin meshes coarsening for biomolecular simulation
Computer Aided Geometric Design
Contour-Based terrain model reconstruction using distance information
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Feature-sensitive tetrahedral mesh generation with guaranteed quality
Computer-Aided Design
Efficient large-scale terrain rendering method for real-world game simulation
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
Simplification of unstructured tetrahedral meshes by point sampling
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
| 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.