Fully generalized two-dimensional constrained delaunay mesh refinement

SIAM Journal on Scientific Computing

Volumn 32, Issue 5, 2010, Pages 2659-2686

  Foteinos, Panagiotis A ^a   Chernikov, Andrey N ^a   Chrisochoides, Nikos P ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

Delaunay triangulation; Mesh generation

Indexed keywords

GRADING;

CONSTRAINED DELAUNAY; DELAUNAY MESHES; DELAUNAY TRIANGULATION; GENERALIZED ALGORITHMS; INFINITE NUMBERS; LOW BOUND; MESH REFINEMENT; REFINEMENT ALGORITHMS; STEINER POINTS; TWO-DIMENSIONAL;

MESH GENERATION;

EID: 78149298674     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/090763226     Document Type: Article

References (24)

1. A. Bowyer, Computing Dirichlet tesselations, Comput. J., 24 (1981), pp. 162-166.
2. CGAL, Computational Geometry Algorithms Library, http://www.cgal.org.
3. A. N. Chernikov and N. P. Chrisochoides, Generalized Delaunay mesh refinement: From scalar to parallel, in Proceedings of the 15th International Meshing Roundtable, P. P. Pébay, ed., Springer, Berlin, 2006, pp. 563-580.
4. A. N. Chernikov and N. P. Chrisochoides, Three-dimensional semi-generalized point placement method for Delaunay mesh refinement, in Proceedings of the 16th International Meshing Roundtable, M. L. Brewer, D. Marcum, eds., Springer, Berlin, 2008, pp. 25-44.
5. A. N. Chernikov and N. P. Chrisochoides, Three-dimensional Delaunay refinement for multi-core processors, in Proceedings of the 22nd Annual International Conference on Supercomputing, ACM, New York, 2008, pp. 205-213.
6. A. N. Chernikov and N. P. Chrisochoides, Generalized two-dimensional Delaunay mesh refinement, SIAM J. Sci. Comput., 31 (2009), pp. 3387-3403.
7. L. P. Chew, Guaranteed-quality triangular meshes, Technical report TR89983, Computer Science Department, Cornell University, Ithaca, NY, 1989.
8. L. P. Chew, Guaranteed quality mesh generation for curved surfaces, in Proceedings of the Ninth Annual Symposium on Computational Geometry, ACM, New York, 1993, pp. 274- 280.
9. L. P. Chew, Guaranteed-quality Delaunay meshing in 3D, in Proceedings of the Thirteenth Annual Symposium on Computational Geometry, ACM, New York, 1997, pp. 391-393.
10. H. Erten and A. Üngör, Triangulations with locally optimal Steiner points, in Proceedings of the Fifth Eurographics Symposium on Geometry Processing, Eurographics Association, Aire-la-Ville, Switzerland, 2007, pp. 143-152.
11. L. A. Freitag and C. Ollivier-Gooch, A Cost/Benefit Analysis of Simplicial Mesh Improvement Techniques as Measured by Solution Efficiency, Preprint ANL/MCS-P722-0598, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 2000.
12. P.-L. George and H. Borouchaki, Delaunay Triangulation and Meshing: Application to Finite Elements, Hermes, Ottawa, Canada, 1998.
13. B. Hudson, Safe Steiner points for Delaunay refinement, in 17th International Meshing Roundtable Research Notes, Sandia National Laboratories, Livermore, CA, 2008.
14. X.-Y. Li, Generating well-shaped d-dimensional Delaunay meshes, Theoret. Comput. Sci., 296 (2003), pp. 145-165.
15. G. L. Miller, A time efficient Delaunay refinement algorithm, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2004, pp. 400- 409.
16. G. L. Miller, S. E. Pav, and N. Walkington, When and why Ruppert's algorithm works, in Proceedings of the 12th International Meshing Roundtable, Sandia National Laboratories, Livermore, CA, 2003, pp. 91-102.
17. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington, A Delaunay based numerical method for three dimensions: Generation, formulation, and partition, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, ACM, New York, 1995, pp. 683-692.
18. J. Ruppert, A Delaunay refinement algorithm for quality 2-dimensional mesh generation, J. Algorithms, 18 (1995), pp. 548-585.
19. J. R. Shewchuk, Constrained Delaunay tetrahedralizations and provably good boundary recovery, in Proceedings of the 11th International Meshing Roundtable, Sandia National Laboratories, Livermore, CA, 2002, pp. 193-204.
20. J. R. Shewchuk, Delaunay refinement algorithms for triangular mesh generation, Comput. Geom., 22 (2002), pp. 21-74.
21. J. R. Shewchuk, What is a good linear element?-Interpolation, conditioning, and quality Measures, in Proceedings of the 11th International Meshing Roundtable, Sandia National Laboratories, Livermore, CA, 2002, pp. 115-126.
22. A. Üngör, Off-centers: A new type of Steiner points for computing size-optimal guaranteedquality Delaunay triangulations, in Proceedings of LATIN, Elsevier B.V., Amsterdam, The Netherlands, 2004, pp. 152-161.
23. VTK, Visualization Toolkit, http://www.vtk.org.
24. D. F. Watson, Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes, Comput. J., 24 (1981), pp. 167-172.