Sink insertion for mesh improvement

International Journal of Foundations of Computer Science

Volumn 13, Issue 2, 2002, Pages 223-242

  Edelsbrunner, Herbert ^a,b   Guoy, Damrong ^c  

^a Duke University   (United States)

^b Raindrop Geomagic   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Delaunay triangulations; dynamic data structures; experimentation; Mesh generation; mesh quality; parallel meshing

Indexed keywords

EID: 0011650557     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054102001060     Document Type: Article

References (9)

1. P. S. ALEXANDROV. Combinatorial Topology, Volumes 1, 2 and 3 Dover, Mineola, New York, 1998.
2. L. P. CHEW. Guaranteed-quality triangular meshes. Report TR 89-983, Comput. Sci. Dept., Cornell Univ., Ithaca, New York, 1989.
3. B. DELAUNAY. Sur la sphere vide. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk 7 (1934), 793-800.
4. T. K. DEY, C. BAJAJ AND K. SUGIHARA. On good triangulations in three dimensions. Internal. J. Comput. Geom. Appl. 2 (1992), 75-95.
5. H. EDELSBRUNNER AND E. P. MUCKE. Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans, Graphics 9 (1990), 66-104.
6. H. EDELSBRUNNER, M. A. FACELLO AND J. LIANG. On the definition and the construction of pockets in macromolecules. Discrete Appl. Math. 88 (1998), 83-102.
7. J. RuPPERT. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18 (1995), 548-585.
8. J. SHEWCHUK. Tetrahedral mesh generation by Delaunay refinement. In "Proc. 14th Ann. Sympos. Comput. Geom., 1998", 86-95.
9. D. F. WATSON. Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes. Computer Journal 24 (1981), 167-172.