Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
Authors:
- 18 January 2006
- book chapter
- Published by Springer Nature
- p. 147-163
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Constrained boundary recovery for three dimensional Delaunay triangulationsInternational Journal for Numerical Methods in Engineering, 2004
- ‘Ultimate’ robustness in meshing an arbitrary polyhedronInternational Journal for Numerical Methods in Engineering, 2003
- A POINT-PLACEMENT STRATEGY FOR CONFORMING DELAUNAY TETRAHEDRALIZATIONInternational Journal of Computational Geometry & Applications, 2001
- Incremental topological flipping works for regular triangulationsAlgorithmica, 1996
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJournal of Algorithms, 1995
- Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraintsInternational Journal for Numerical Methods in Engineering, 1994
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Constrained delaunay triangulationsAlgorithmica, 1989
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal AlgorithmSIAM Journal on Computing, 1984
- On Indecomposable PolyhedraThe American Mathematical Monthly, 1948