A time-optimal delaunay refinement algorithm in two dimensions

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 228-236

  Har Peled, Sariel ^a   Üngör, Alper ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Florida   (United States)

Author keywords

Delaunay triangulation; Mesh quality; Mesh refinement; Quadtree; Steiner points

Indexed keywords

COMPUTATIONAL GEOMETRY; TREES (MATHEMATICS);

DELAUNAY TRIANGULATION; MESH QUALITY; MESH REFINEMENT; QUADTREE; STEINER POINTS;

ALGORITHMIC LANGUAGES;

EID: 33244476967     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064128     Document Type: Conference Paper

References (18)

1. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comput. Syst. Sci., 48:384-409, 1994.
2. M. Bern, D. Eppstein, and S.-H. Teng. Parallel construction of quadtrees and quality triangulations. Internat. J. Comput. Geom. Appl., 9(6):517-532, 1999.
3. L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97-108, 1989.
4. L. P. Chew. Guaranteed-quality triangular meshes. Technical Report TR-89-983, Dept. Comput. Sci., Cornell Univ., Ithaca, NY, Apr. 1989.
5. T. K. Dey, C. L. Bajaj, and K. Sugihara. On good triangulations in three dimensions. Internat. J. Comput. Geom. Appl., 2(1):75-95, 1992.
6. H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, 2001.
7. H. Edelsbrunner and D. Guoy. Sink insertion for mesh improvement. In Proc. 17th ACM Symp. Comp. Geom., pages 115-123, 2001.
8. R. Lohner. Progress in grid generation via the advancing front technique. Engineering with Computers, 12:186-210, 1996.
9. G. L. Miller. A time efficient Delaunay refinement algorithm. In Proc. 15th ACM-SIAM Sympos. Discrete Algorithms, pages 400-409, 2004.
10. G. L. Miller, S. Pav, and N. Walkington. When and why Ruppert's algorithm works. In Proc. 12th Int. Meshing Roundtable, pages 91-102, 2003.
11. G. L. Miller, D. Talmor, S.-H. Teng, and N. Walkington. A Delaunay based numerical method for three dimensions: generation, formulation, and partition. In Proc. 27th ACM Sympos on Theory of Computing, pages 683-692, 1995.
12. S. A. Mitchell and S. A. Vavasis. Quality mesh generation in higher dimensions. SIAM J. Comput., 29:1334-1370, 2000.
13. J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, pages 83-92, 1993.
14. J. R. Shewchuk. Delaunay Refinement Mesh Generation. PhD thesis, Carnegie Mellon University, 1997.
15. D. A. Spielman, S.-H. Teng, and A. Üngör. Parallel Delaunay refinement: Algorithms and analyses. In Proc. 11th Int. Meshing Roundtable, pages 205-217, 2002.
16. D. A. Spielman, S.-H. Teng, and A. Üngör. Time complexity of practical parallel Steiner point insertion algorithms. In Proc. 16th ACM Sympos. Parallel Alg. Arch., pages 267-268, 2004.
17. G. Strang and G. Fix. An Alaysis of the Finite Element Method. Prentice Hall, Englewood Cliffs, NJ, 1973.
18. A. Üngör. Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations, In Latin Amer, Theo. Inf. Symp., pages 152-161, 2004.