External-memory algorithms for processing line segments in geographic information systems

DOI10.1007/3-540-60313-1_151zbMath1512.68436OpenAlexW1482143372MaRDI QIDQ6102308

Jeffrey Scott Vitter, Lars Arge, Darren Erik Vengroff

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_151

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (7)

I/O-efficient dynamic planar point location ⋮ The buffer tree: A new technique for optimal I/O-algorithms ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ I/O-efficient algorithms for computing planar geometric spanners ⋮ I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions ⋮ I/O-efficient point location using persistent B-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Fractional cascading. I: A data structuring technique
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Algorithms for parallel memory, I: Two-level memories
• Batched dynamic solutions to decomposable searching problems
• Triangulating Simple Polygons and Equivalent Problems
• Rectilinear line segment intersection, layered segment trees, and dynamization
• An optimal algorithm for intersecting line segments in the plane
• A general lower bound on the I/O-complexity of comparison-based algorithms
• Counting and reporting red/blue segment intersections

This page was built for publication: External-memory algorithms for processing line segments in geographic information systems