Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep

DOI10.1016/S0925-7721(97)00020-5zbMath0894.68084OpenAlexW2031067906MaRDI QIDQ1384210

Yi-Jen Chiang

Publication date: 13 April 1998

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(97)00020-5

zbMATH Keywords

graphicsVLSI layoutorthogonal segment intersection problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• 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
• Fast permuting on disk arrays
• Blocking for external graph searching
• Organization and maintenance of large ordered indexes
• The Maximum Size of Dynamic Data Structures
• Fast Algorithms for Geometric Traveling Salesman Problems
• Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
• Memory Paging for Connectivity and Path Problems in Graphs
• The buffer tree: A new technique for optimal I/O-algorithms
• Topology B-trees and their applications
• A general lower bound on the I/O-complexity of comparison-based algorithms
• 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 versus plane sweep