Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 152-161

  Üngör, Alper ^a  

^a Duke University   (United States)

Author keywords

Computational geometry; Delaunay refinement; Triangulations

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; SURVEYING; TRIANGULATION;

DELAU-NAY TRIANGULATIONS; DELAUNAY REFINEMENTS; OPTIMALITY; QUALITY GUARANTEED; REFINEMENT ALGORITHMS; SIZE OPTIMAL; STEINER POINTS;

ITERATIVE METHODS;

EID: 35048852526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_19     Document Type: Article

References (11)

1. M. Bern, D. Eppstein, and J. Gilbert. Provably good mesh generation. J. Comp. System Sciences 48:384-409, 1994.
2. L.P. Chew. Guaranteed-quality triangular meshes. TR-89-983, Cornell Univ., 1989.
3. L.P. Chew. Constrained Delaunay triangulations. Algorithmica 4:97-108, 1989.
4. T.K. Dey, C. L. Bajaj, and K. Sugihara. On good triangulations in three dimensions. Int. J. Computational Geometry & Applications 2(1):75-95, 1992.
5. H. Edelsbrunner. Geometry and Topology for Mesh Generation. Cambridge Univ. Press, 2001.
6. H. Edelsbrunner and D. Guoy. Sink insertion for mesh improvement. Proc. 17th ACM Symp. Comp. Geometry, 115-123, 2001.
7. G.L. Miller. A time efficient Delaunay refinement algorithm. Proc. ACM-SIAM Symp. on Disc. Algorithms, (to appear), 2004.
8. G.L. Miller, S. Pav, and N. Walkington. When and why Ruppert's algorithm works. Proc. 12th Int. Meshing Roundtable, 91-102, 2003.
9. J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. Proc. 4th ACM-SIAM Symp. on Disc. Algorithms, 83-92, 1993.
10. J.R. Shewchuk. Delaunay Refinement Mesh Generation. Ph.D. thesis, Carnegie Mellon University, 1997.
11. D.A. Spielman, S.-H. Teng, and A. Üngör. Parallel Delaunay refinement: Algorithms and analyses. Proc. 11th Int. Meshing Roundtable, 205-217, 2002.