Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
From MaRDI portal
Publication:5057447
DOI10.1007/3-540-60220-8_75zbMath1502.68307OpenAlexW1885286792MaRDI QIDQ5057447
Publication date: 16 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60220-8_75
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for parallel memory, I: Two-level memories
- The input/output complexity of transitive closure
- Blocking for external graph searching
- Indexing for data models with constraints and classes
- Organization and maintenance of large ordered indexes
- The Maximum Size of Dynamic Data Structures
- Memory Paging for Connectivity and Path Problems in Graphs
- 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
- Topology B-trees and their applications
- External-memory algorithms for processing line segments in geographic information systems
This page was built for publication: Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
