Boundary refinement in delaunay mesh generation using arbitrarily ordered vertex insertion

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 282-285

  Nave, Démian M ^a   Chrisochoides, Nikos ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

BOUNDARY REFINEMENTS; CONSTRAINED DELAUNAY; DELAUNAY; DELAUNAY MESHING; GUARANTEED QUALITY; MESH BOUNDARIES; PARALLEL VERSION; STRICT ORDERINGS;

MESH GENERATION;

EID: 35248850499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Bowyer. Computing Dirichlet tessellations. The Computer Journal, 24(2):162-166, 1981.
2. S.-W. Cheng and T. K. Dey. Quality meshing with weighted delaunay refinement. In 13th ACM-SIAM Symposium on Discrete Algorithms, pages 137-146, 2002.
3. S.-W. Cheng, T. K. Dey, E. A. Ramos, and T. Ray. Quality meshing for polyhedra with small angles. In 20th Annual Symposium on Computational Geometry, 2004.
4. S.-W. Cheng and S.-H. Poon. Graded conforming delaunay tetrahedralization with bounded radius-edge ratio. In 14th ACM-SIAM Symposium on Discrete Algorithms, pages 295-304. Society for Industrial and Applied Mathematics, 2003.
5. L. P. Chew. Constrained delaunay triangulations. Algorithmica, 4:97-108, 1989.
6. N. Chrisochoides and D. Nave. Parallel Delaunay mesh generation kernel. In special issue of International Journal for Numerical Methods in Engineering, 58(2):161-176, 2003.
7. H. Edelsbrunner and D. Guoy. Sink insertion for mesh improvement. In 17th Annual Symposium on Computational Geometry, pages 115-123, 2001.
8. X.-Y. Li and S.-H. Teng. Generating Well-Shaped delaunay meshes in 3D. In 12th ACM-SIAM Symposium on Discrete Algorithms, pages 28-37, 2001.
9. D. Nave, N. Chrisochoides, and L. P. Chew. Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains. Journal of Computational Geometry: Theory and Applications, 28(2-3):195-215, June 2004. Also appears in 18th Annual Symposium on Computational Geometry.
10. J. Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
11. J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, School of Computer Science, May 1997. Available as Technical Report CMU-CS-97-137.
12. J. R. Shewchuk. Mesh generation for domains with small angles. In Sixteenth Annual Symposium on Computational Geometry, pages 111-112. ACM, 2000.
13. D. Spielman, S.-H. Teng, and A. Üngör. Delaunay refinement: Algorithms and analyses. In 11th International Meshing Roundtable, pages 205-217, 2002.
14. D. F. Watson. Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. The Computer Journal, 24(2):167-172, 1981.