Generalized two-dimensional delaunay mesh refinement

SIAM Journal on Scientific Computing

Volumn 31, Issue 5, 2009, Pages 3387-3403

  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

DELAUNAY MESHES; DELAUNAY REFINEMENTS; DELAUNAY TRIANGULATION; GENERATION METHOD; MESH REFINEMENT; ONE-DIMENSIONAL; PARALLELIZATIONS; REFINEMENT ALGORITHMS; STEINER POINTS; TWO-DIMENSIONAL;

MESH GENERATION;

EID: 78149319525     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080723028     Document Type: Article

References (21)

1. M. W. Bern and D. Eppstein, Mesh generation and optimal triangulation, in Computing in Euclidean Geometry, Vol. 1, Lecture Notes Ser. Comput., D.-Z. Du and F. Hwang, eds., World Scientific, River Edge, NJ, 1992, pp. 23-90.
2. A. Bowyer, Computing Dirichlet tesselations, Comput. J., 24 (1981), pp. 162-166.
3. A. N. Chernikov and N. P. Chrisochoides, Generalized Delaunay mesh refinement: From scalar to parallel, in Proceedings of the 15th International Meshing Roundtable, Birmingham, AL, 2006, Springer, pp. 563-580.
4. A. N. Chernikov and N. P. Chrisochoides, Parallel guaranteed quality Delaunay uniform mesh refinement, SIAM J. Sci. Comput., 28 (2006), pp. 1907-1926. (Pubitemid 47457332)
5. 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, Seattle, WA, 2007, Springer, pp. 25-44.
6. L. P. Chew, Guaranteed-quality Triangular Meshes, Technical report TR89983, Cornell University, Computer Science Department, Ithaca, NY, 1989.
7. L. P. Chew, Guaranteed quality mesh generation for curved surfaces, in Proceedings of the 9th ACM Symposium on Computational Geometry, San Diego, CA, 1993, pp. 274-280.
8. L. P. Chew, Guaranteed-quality Delaunay meshing in 3D, in Proceedings of the 13th ACM Symposium on Computational Geometry, Nice, France, 1997, pp. 391-393.
9. B. N. Delaunay, Sur la sphere vide, Izvestia Akademia Nauk SSSR, VII Seria, Otdelenie Mataematicheskii i Estestvennyka Nauk, 7 (1934), pp. 793-800.
10. W. H. Frey, Selective refinement: A new strategy for automatic node placement in graded triangular meshes, Internat. J. Numer. Methods Engrg., 24 (1987), pp. 2183-2200.
11. P.-L. George and H. Borouchaki, Delaunay Triangulation and Meshing. Application to Finite Elements, Hermes, Oxford, 1998.
12. X.-Y. Li, Generating well-shaped d-dimensional Delaunay meshes, Theoret. Comput. Sci., 296 (2003), pp. 145-165.
13. X.-Y. Li and S.-H. Teng, Generating well-shaped Delaunay meshes in 3D, in Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms, Washington, D.C., 2001, pp. 28-37.
14. L. Linardakis and N. Chrisochoides, Delaunay decoupling method for parallel guaranteed quality planar mesh refinement, SIAM J. Sci. Comput., 27 (2006), pp. 1394-1423. (Pubitemid 44077332)
15. L. Linardakis and N. Chrisochoides, Graded Delaunay decoupling method for parallel guaranteed quality planar mesh generation, SIAM J. Sci. Comput., 30 (2008), pp. 1875-1891.
16. G. L. Miller, A time efficient Delaunay refinement algorithm, in Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004, pp. 400-409.
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, Las Vegas, NV, 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, Delaunay refinement algorithms for triangular mesh generation, Comput. Geom., 22 (2002), pp. 21-74.
20. A. Üngör, Off-centers: A new type of Steiner points for computing size-optimal guaranteedquality Delaunay triangulations, in Proceedings of LATIN, Buenos Aires, Argentina, 2004, pp. 152-161.
21. D. F. Watson, Computing the n-dimensional Delaunay tesselation with application to Voronoi polytopes, Comput. J., 24 (1981), pp. 167-172. (Pubitemid 12503887)