Constrained boundary recovery for three dimensional Delaunay triangulations
By Qiang Du, Desheng Wang. 2004
52 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design, Environmental Engineering
View Paper: https://www.semanticscholar.org/paper/2cb764d2c085af401670ff6ef8e2f783a3d39f2d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
In Environmental Engineering
Citations in the corpus
- Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations (2005, background): “Generally non-CDT algorithms [17, 18, 19, 10, 20, 22] will continuously insert points on the missing facets or the inside of the PLC.”
- TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator (2015, methodology): “More sophisticated methods to deal with these issues are proposed [Liu and Baida 2000; Du and Wang 2004; Chen et al. 2011].”