scientific article; zbMATH DE number 1424323

MaRDI QIDQ4945537zbMATH OpenFDO

Authors A. Crauser, Paolo Ferragina, K. Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Publication date 7 June 2000

zbMATH Keywords

computer graphicsgeographic information systems

Mathematics Subject Classification ID

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

Recommendations

• RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
• An optimal algorithm for intersecting line segments in the plane
• Line-segment intersection made in-place
• External-memory algorithms for processing line segments in geographic information systems
• External-memory algorithms for processing line segments in geographic information systems

Cited in

(4)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• Cache-Oblivious Red-Blue Line Segment Intersection
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
• Permuting and batched geometric lower bounds in the I/O model

This page was built for publication:

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