External-memory algorithms for processing line segments in geographic information systems
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- External-memory computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Triangulating a simple polygon in linear timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweepPublished by Springer Nature ,1995
- The buffer tree: A new technique for optimal I/O-algorithmsPublished by Springer Nature ,1995
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- An optimal algorithm for intersecting line segments in the planeJournal of the ACM, 1992
- The input/output complexity of sorting and related problemsCommunications of the ACM, 1988
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Batched dynamic solutions to decomposable searching problemsJournal of Algorithms, 1985
- Triangulating Simple Polygons and Equivalent ProblemsACM Transactions on Graphics, 1984