I/O-efficient batched union-find and its applications to terrain analysis

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 167-176

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

^a Duke University   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Contour trees; I O efficient algorithms; Terrain analysis; Union find

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CONFORMAL MAPPING; DATA STORAGE EQUIPMENT; DATA STRUCTURES; FUNCTION EVALUATION; GRAPH THEORY; LANDFORMS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONTOUR TREES; I/O-EFFICIENT ALGORITHMS; TERRAIN ANALYSIS; UNION-FIND PROBLEMS;

INPUT OUTPUT PROGRAMS;

EID: 33748036730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137884     Document Type: Conference Paper

References (36)

1. P. K. Agarwal, L. Arge, and K. Yi. I/O-efficient construction of constrained Delaunay triangulations. In Proc. 13rd European Sympos. Algorithms, pages 355-366, 2005.
2. P. K. Agarwal, H. Edelsbrunner, J. Harer, and Y. Wang. Extreme elevation on a 2-manifold. In Proc. 20th Annu. Sympos. Comput. Geom., pages 357-365, 2004.
3. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9):1116-1127, 1988.
4. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-358. Kluwer Academic Publishers, 2002.
5. L. Arge, G. S. Brodal, and L. Toma. On external memory MST, SSSP and multi-way planar graph separation. J. Algorithms, 53(2): 186-206, 2004.
6. L. Arge, J. Chase, P. Halpin, L. Toma, D. Urban, J. S. Vitter, and R. Wickremesinghe. Flow computation on massive grid terrains. GeoInformatica, 7(4):283-313, 2003.
7. L. Arge, O. Procopiuc, and J. S. Vitter. Implementing I/O-efficient data structures using TPIE. In Proc. 10th European Sympos. Algorithms, pages 88-100, 2002.
8. L. Arge, D. E. Vengroff, and J. S. Vitter. External-memory algorithms for processing line segments in geographic information systems. Proc. 3rd European Sympos. Algorithms, pages 295-310, 1995.
9. B. Becker, S. Gschwind, T. Ohler, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-tree. VLDB Journal, 5(4):264-275, 1996.
10. P. T. Bremer, V. Pascucci, H. Edelsbrunner, and B. Hamann. A topological hierarchy for functions on triangulated surfaces. IEEE Trans. Vis. Comput. Graphics, 10:385-396, 2004.
11. H. Carr, J. Snoeyink, and U. Axen. Computing contour trees in all dimensions. Comput. Geom. Theory Appl., 24:75-94, 2003.
12. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J, S. Vitter. External-memory graph algorithms. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 139-149, 1995.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition. The MIT Press, Cambridge, Mass., 2001.
14. R. Dementiev, P. Sanders, D. Schultes, and J. Sibeyn. Engineering an external memory minimum spanning tree algorithm. In Proc. 3rd IFIP Intl. Conf. on Theoretical Computer Science, pages 195-208, 2004.
15. H. Edelsbrunner, J. Harer, and A. Zomorodian. Hierarchical Morse complexes for piecewise linear 2-manifolds. In Proc. 17th Annu. Sympos. Comput. Geom., pages 70-79, 2001.
16. H. Edelsbrunner, D. Letscher, and A. Zomorodian. Topological persistence and simplification. In Proc. 41st IEEE Sympos. Found. Comput. Sci., pages 454-463, 2000.
17. Environmental Systems Research Inc. ARC/INFO Professional GIS, 1997. Version 7.1.2.
18. F. W. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In Proc. 31st IEEE Sympos. Found. Comput. Sci. pages 718-725, 1990.
19. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM Sympos. Theory Comput., pages 345-354, 1989.
20. H. Gabow and R. Tarjan. A linear time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci., 30:209-221, 1985.
21. B. A. Galler and M. J. Fisher. An improved equivalence algorithm. Commun. ACM, 7(5):301-303, 1964.
22. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. 34th IEEE Sympos. Found. Comput. Sci., pages 714-723, 1993.
23. GRASS Development Team. GRASS GIS homepage. http://www.baylor.edu/grass/.
24. S. Jenson and J. Domingue. Extracting topographic structure from digital elevation data for geographic information system analysis. Photogrammetric Engineering and Remote Sensing, 54(11):1593-1600, 1988.
25. B. M. E. Moret and H. D. Shapiro. An empirical analysis of algorithms for constructing a minimum spanning tree. In Proc. Workshop Algorithms Data Struct., pages 400-411, 1991.
26. North Carolina Flood Mapping Program. http://www.ncfloodmaps.com.
27. J. F. O'Callaghan and D. M. Mark. The extraction of drainage networks from digital elevation data. Computer Vision, Graphics and Image Processing, 28, 1984.
28. R. Seidel and M. Sharir, Top-down analysis of path compression. SIAM J. Comput., 34(3):515-525, 2005.
29. S. P. Tarasov and M. N. Vyalyi. Construction of contour trees in 3D in O(n log n) steps. In Proc. 14th Annu. Sympos. Comput. Geom., pages 68-75, 1998.
30. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22:215-225, 1975.
31. R. E. Tarjan. A class of algorithms that require nonlinear time to maintain disjoint sets. J. Comput. and Sys. Sci., 18:110-127, 1979.
32. R. E. Tarjan and J. V. Leeuwen. Worst-case analysis of set union algorithms, J. ACM, 31:245-281, 1984.
33. M. van den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In Proc. Intl. Conf. Very Large Databases, pages 406-415, 1997.
34. M. van Kreveld, R. van Oostrum, C. Bajaj, V. Pascucci, and D, Schikore. Contour trees and small seed sets for isosurface traversal. In Proc. 13th Annu. Sympos. Comput. Geom., pages 212-219, 1997.
35. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Comput. Surveys, 33(2):209-271, 2001.
36. A. Zomorodian. Topology for Computing. Cambridge University Press, 2005.