Faster circle packing with application to nonobtuse triangulation

International Journal of Computational Geometry and Applications

Volumn 7, Issue 5, 1997, Pages 485-491

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Circle packing; Mesh generation; Nonobtuse triangulation

Indexed keywords

EID: 0031497976     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195997000296     Document Type: Article

References (11)

1. W. P. Thurston. The Geometry and Topology of 3-manifolds. Princeton University Notes, 1988.
2. P. Doyle, Z.-X. He, and B. Rodin. Second derivatives of circle packings and conformal mappings. Discrete & Computational Geometry 11 (1994) 35-49.
3. B. Ewins. Untitled manuscript, available for anonymous FTP at address ftp://riscl.rug.nl/origami/articles/circles.ps (Sept 1994).
4. M. Bern, S. Mitchell, and J. Ruppert. Linear-size nonobtuse triangulation of polygons. Pros. 10th ACM Symp. Computational Geometry (1994) 221-230.
5. M. Bern and D. Eppstein. Polynomial-size nonobtuse triangulation of polygons. Int. J. Computational Geometry & Applications 2 (1992) 241-255.
6. D. Eppstein, G. L. Miller, and S.-H. Teng. A deterministic linear time algorithm for geometric separators and its applications. Fundamenta Informaticae 22 (1995) 309-330.
7. D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Computer & Systems Sciences 24 (1983) 362-381.
8. M. McAllister, D. Kirkpatrick, and J. Snoeyink. A compact piecewise-linear Voronoi diagram for convex sites in the plane. Proc. 34th IEEE Symp. Foundations of Computer Science (1993) 573-582.
9. D. Cheriton and R. E. Tarjan. Finding minimum spanning trees. SIAM J. Computing 5 (1976) 310-313.
10. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.
11. G. L. Miller, S.-H. Teng, and S. A. Vavasis. A unified geometric approach to graph separators. Proc. 32nd IEEE Symp. Foundations of Computer Science (1991) 538-547.