Further computational geometry in secondary memory

DOI10.1007/3-540-58325-4_218MaRDI QIDQ4525742zbMATH OpenFDO

Authors Binhai Zhu

Publication date 24 January 2001

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

Full work available at URL https://doi.org/10.1007/3-540-58325-4_218

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1424315
• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• scientific article; zbMATH DE number 4037201
• scientific article; zbMATH DE number 3974322
• Computational geometry -- some easy questions and their recent solutions

Cited in

(3)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• Geometrical Optics and Models of Computer Memory Fragmentation
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This page was built for publication: Further computational geometry in secondary memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525742)