3D delaunay refinement of sharp domains without a local feature size oracle

Proceedings of the 17th International Meshing Roundtable, IMR 2008

Volumn , Issue , 2008, Pages 37-53

  Rand, Alexander ^a   Walkington, Noel ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY MESHES; DELAUNAY REFINEMENTS; LOCAL FEATURE SIZE; PIECEWISE LINEAR; REFINEMENT ALGORITHMS; SMALL INPUTS;

PIECEWISE LINEAR TECHNIQUES;

EID: 80755170834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-87921-3_3     Document Type: Conference Paper

References (12)

1. Cheng, S.-W., Dey, T.K., Levine, J.A.: A practical Delaunay meshing algorithm for a large class of domains. In: Proceedings of the 16th International Meshing Roundtable (October 2007)
2. Cheng, S.-W., Poon, S.-H.: Three-dimensional Delaunay mesh generation. Discrete Comput. Geom. 36(3), 419-456 (2006)
3. Cohen-Steiner, D., de Verdière, E.C., Yvinec, M.: Conforming Delaunay triangulations in 3D. Comput. Geom. Theory Appl. 28(2-3), 217-233 (2004)
4. Miller, G.L., Pav, S.E., Walkington, N.J.: An incremental Delaunay meshing algorithm. Technical Report 02-CNA-023, Center for Nonlinear Analysis, Carnegie Mellon University, Pittsburgh, Pennsylvania (2002)
5. Miller, G.L., Pav, S.E., Walkington, N.J.: When and why Ruppert's algorithm works. In: Proceedings of the 12th International Meshing Roundtable, pp. 91-102 (September 2003)
6. Murphy, M., Mount, D.M., Gable, C.W.: A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry and Applications 11(6), 669-682 (2001)
7. Pav, S.E., Walkington, N.J.: Robust three dimensional Delaunay refinement. In: Proceedings of the 13th International Meshing Roundtable (September 2004)
8. Pav, S.E., Walkington, N.J.: Delaunay refinement by corner lopping. In: Proceedings of the 14th International Meshing Roundtable (September 2005)
9. Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548-585 (1995)
10. Shewchuk, J.R.: Mesh generation for domains with small angles. In: Symposium on Computational Geometry, pp. 1-10 (2000)
11. Si, H.: On refinement of constrained Delaunay tetrahedralizations. In: Proceedings of the 15th International Meshing Roundtable (September 2006)
12. Si, H., Gartner, K.: Meshing piecewise linear complexes by constrained Delaunay tetrahedralizations. In: Proceedings of the 14th International Meshing Roundtable (September 2005)