I/O-efficient construction of constrained delaunay triangulations

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 355-366

  Agarwal, Pankaj K ^a   Arge, Lars ^a,b   Yi, Ke ^a  

^a Duke University   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA REDUCTION; DATA STORAGE EQUIPMENT; INPUT OUTPUT PROGRAMS; SET THEORY;

DELAUNAY TRIANGULATION; MEMORY SIZE; REAL DATA;

ALGORITHMS;

EID: 27144510586     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_33     Document Type: Conference Paper

References (17)

1. North Carolina Flood Mapping Program, http://www.ncfloodmaps.com.
2. A. Aggarwal and J. S. Vitter. The Input/Output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
3. N. Amenta, S. Choi, and G. Rote. Incremental constructions con brio. In Proc. 19th Annu. ACM Sympos. Comput. Geom., pages 221-219, 2003.
4. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing I/O-efficient data structures using TPIE. In Proc. European Symposium on Algorithms, pages 88-100, 2002.
5. F. Aurenhammer and R. Klein. Voronoi diagrams. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
6. G. E. Blelloch, G. L. Miller, J. C. Hardwick, and D. Talmor. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24(3):243-269, 1999.
7. The CGAL Reference Manual, 1999. Release 2.0.
8. L. P. Chew. Constrained Delaunay triangulations. Algorithmica, 4:97-108, 1989.
9. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
10. A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. Ramos. Randomized external-memory algorithms for some geometric problems. International Journal of Computational Geometry & Applications, 11(3):305-337, June 2001.
11. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. IEEE Symposium on Foundations of Computer Science, pages 714-723, 1993.
12. L. J. Guibas, D. E. Knuth, and M. Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
13. P. Kumar and E. A. Ramos. I/O-efficient construction of voronoi diagrams. Technical report, 2002.
14. K. Mehlhorn and S. Näher. LED A: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK, 2000.
15. R. Seidel. Constrained Delaunay triangulations and Voronoi diagrams with obstacles. Computer Science Division, ??, June 1989. UC Berkeley.
16. J. R. Shewchuk. Triangle: engineering a 2d quality mesh generator and Delaunay triangulator. In First Workshop on Applied Computational Geometry. Association for Computing Machinery, May 1996.
17. TIGER/Line™ Files, 1997 Technical Documentation. Washington, DC, September 1998. http://www.census.gov/geo/tiger/TIGER97D.pdf.