External-Memory Algorithms for Processing Line Segments in Geographic Information Systems

In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing I/O communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this paper we develop efficient external-memory algorithms for a number of important problems involving line segments in the plane, including trapezoid decomposition, batched planar point location, triangulation, red--blue line segment intersection reporting, and general line segment intersection reporting. In GIS systems the first three problems are useful for rendering and modeling, and the latter two are frequently used for overlaying maps and extracting information from them.

[1]  Kurt Mehlhorn,et al.  Dynamic point location in general subdivisions , 1992, SODA '92.

[2]  Lars Arge,et al.  The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract) , 1995, WADS.

[3]  J. Sack,et al.  Early Experiences in Implementing the Buffer Tree , 1997, WAE.

[4]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[5]  Jack Snoeyink,et al.  Counting and Reporting Red/Blue Segment Intersections , 1993, WADS.

[6]  Michael T. Goodrich,et al.  Topology B-Trees and Their Applications , 1995, WADS.

[7]  Derek Thompson,et al.  Fundamentals of spatial information systems , 1992, A.P.I.C. series.

[8]  Jeffrey Scott Vitter,et al.  Optimal dynamic interval management in external memory , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Binhai Zhu,et al.  Further Computational Geometry in Secondary Memory , 1994, ISAAC.

[10]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.

[11]  Lars Arge,et al.  The Buffer Tree: A Technique for Designing Batched External Data Structures , 2003, Algorithmica.

[12]  R. Cramer,et al.  Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments , 1996 .

[13]  Yale N. Patt,et al.  The I/O Subsystem - A Candidate for Improvement: Guest Editor's Introduction , 1994, Computer.

[14]  Jeffrey Scott Vitter,et al.  Paradigms for optimal sorting with multiple disks , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[15]  Marc J. van Kreveld,et al.  Geographic information systems , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[16]  Lars Arge,et al.  The Buuer Tree: a New Technique for Optimal I/o-algorithms ? , 1995 .

[17]  Leonidas J. Guibas,et al.  Algorithms for bichromatic line-segment problems and polyhedral terrains , 1994, Algorithmica.

[18]  Lars Arge.  External-Memory Algorithms with Applications in Geographic Information Systems , 1997 .

[19]  Josva Kleist,et al.  Bisimulations for Asynchronous Mobile Processes , 1995 .

[20]  Teresa Connolly,et al.  Understanding GIS; The ARC/INFO Method (PC Version) , 1998 .

[21]  Vijay K. Vaishnavi,et al.  Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization , 1982, J. Algorithms.

[22]  Sridhar Ramaswamy,et al.  Path Caching: A Technique for Optimal External Searching , 1994, PODS 1994.

[23]  Thore Husfeldt,et al.  Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching , 1996, SWAT.

[24]  Jyh-Jong Tsay,et al.  External-memory computational geometry , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[25]  Jeffrey Scott Vitter,et al.  Large-scale sorting in parallel memories (extended abstract) , 1991, SPAA '91.

[26]  Maurizio Talamo,et al.  Orders, k-sets and Fast Halfplane Search on Paged Memory , 1994, ORDAL.

[27]  Valeria de Paiva,et al.  Cut-Elimination for Full Intuitionistic Linear Logic , 1996 .

[28]  Laura M. Haas,et al.  Exploiting Extensible DBMS in Integrated Geographic Information Systems , 1991, SSD.

[29]  Lars Arge,et al.  The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation , 1996 .

[30]  J. Vitter,et al.  On Sorting Strings in External Memory , 1997 .

[31]  Jeffrey Scott Vitter,et al.  External-Memory Algorithms for Processing Line Segments in Geographic Information Systems , 1996 .

[32]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[33]  K. V. S. Prasad,et al.  A Machine Verified Distributed Sorting Algorithm , 1996 .

[34]  Sridhar Ramaswamy,et al.  Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems , 1998, SODA '98.

[35]  Martin J. Dürst,et al.  The design and analysis of spatial data structures. Applications of spatial data structures: computer graphics, image processing, and GIS , 1991 .

[36]  Sridhar Ramaswamy,et al.  The P-range tree: a new data structure for range searching in secondary memory , 1995, SODA '95.

[37]  T. M. Murali,et al.  I/O-efficient algorithms for contour-line extraction and planar graph blocking , 1998, SODA '98.

[38]  Sridhar Ramaswamy,et al.  Indexing for Data Models with Constraints and Classes , 1996, J. Comput. Syst. Sci..

[39]  Harry G. Mairson,et al.  Reporting and Counting Intersections Between Two Sets of Line Segments , 1988 .

[40]  Vijay Kumar,et al.  Improved algorithms and data structures for solving graph problems in external memory , 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

[41]  Leonidas J. Guibas,et al.  Fractional cascading: I. A data structuring technique , 1986, Algorithmica.

[42]  Jack Snoeyink,et al.  Counting and Reporting Red/Blue Segment Intersections , 1994, CVGIP Graph. Model. Image Process..

[43]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[44]  Thomas H. Cormen,et al.  Asymptotically tight bounds for performing BMMC permutations on parallel disk systems , 1993, SPAA '93.

[45]  P. Agarwal,et al.  Eecient Searching with Linear Constraints , 1997 .

[46]  Jeffrey Scott Vitter,et al.  Algorithms for parallel memory, I: Two-level memories , 2005, Algorithmica.

[47]  Timothy M. Chan.  A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections , 1994, CCCG.

[48]  Lars Arge,et al.  A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms , 1992 .

[49]  Mark H. Overmars,et al.  Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[50]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[51]  Alessandro Panconesi,et al.  Near-Optimal, Distributed Edge Colouring via the Nibble Method , 1996, Theor. Comput. Sci..

[52]  Richard Cole,et al.  Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[53]  Lars Arge,et al.  A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms , 1992, WADS.

[54]  Robert F. Cromp,et al.  An intelligent information fusion system for handling the archiving and querying of terabyte-sized spatial databases. , 2008 .

[55]  Roberto Grossi,et al.  Fast string searching in secondary storage: theoretical developments and experimental results , 1996, SODA '96.

[56]  M. Goldberg.  An Adequate Left-Associated Binary Numeral System in the-Calculus ( Revised Version ) , 1995 .

[57]  Jeffrey Scott Vitter,et al.  Deterministic distribution sort in shared and distributed memory multiprocessors , 1993, SPAA '93.

[58]  Erik D Vengroff,et al.  I/O Efficient Scientific Computation Using TPIE , 1995 .

[59]  Yi-Jen Chiang,et al.  Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep , 1995, WADS.

[60]  Lars Arge.  External memory data structures , 2002 .

[61]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[62]  Jeffrey Scott Vitter,et al.  I/O-e cient scienti c computation using TPIE , 1996 .

[63]  D. E. Vengro,et al.  Eecient 3-d Range Searching in External Memory , 1995 .

[64]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[65]  Edward F. Grove,et al.  Simple randomized mergesort on parallel disks , 1996, SPAA '96.

[66]  Roberto Grossi,et al.  A fully-dynamic data structure for external substring search , 1995, STOC '95.

[67]  Y.N. Patt,et al.  The I/O subsystem/spl minus/a candidate for improvement , 1994, Computer.

[68]  Jeffrey Scott Vitter,et al.  Greed sort: optimal deterministic sorting on parallel disks , 1995, JACM.