An efficient query structure for mesh refinement

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG 2008

Volumn , Issue , 2008, Pages 115-118

  Hudson, Benoît ^a   Türkoǧlu, Duru ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT TIME; DELAU-NAY TRIANGULATIONS; FULL COSTS; LINEAR TIME; MESH REFINEMENT; MESHING ALGORITHM; QUERY STRUCTURES; VORONOI CELL;

COMPUTATIONAL GEOMETRY;

EID: 84893365361     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Marshall Bern, David Eppstein, and John R. Gilbert. Provably good mesh generation. J. Computer and System Sciences, 48(3):384-409, 1994.
2. Marshall Bern, David Eppstein, and Shang-Hua Teng. Parallel construction of quadtrees and quality triangulations. IJCGA, 9(6):517-532, 1999.
3. Benoît Hudson, Gary L. Miller, and Todd Phillips. Sparse Voronoi Refinement. In IMR, pages 339-356, 2006.
4. Sariel Har-Peled and Alper Üngör. A timeoptimal Delaunay refinement algorithm in two dimensions. In SoCG, pages 228-236, 2005.
5. Ravi Jampani and Alper Üngör. Construction of sparse well-spaced point sets for quality tetrahe-dralizations. In IMR, pages 63-80, 2007.
6. Scott A. Mitchell and Stephen A. Vavasis. Quality mesh generation in higher dimensions. SIAM J. Computing, 29(4):1334-1370, 2000.
7. Jim Ruppert. A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms, 18(3):548-585, 1995.
8. Jonathan Richard Shewchuk. Tetrahedral Mesh Generation by Delaunay Refinement. In SoCG, pages 86-95, 1998.
9. Dafna Talmor. Well-Spaced Points for Numerical Methods. PhD thesis, Carnegie Mellon University, Pittsburgh, August 1997.
10. Alper Üngör. Off-centers: A new type of Steiner point for computing size-optimal quality-guaranteed Delaunay triangulations. In LATIN, pages 152-161, 2004.