Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time

DOI10.1016/0925-7721(92)90022-KzbMath0774.68096MaRDI QIDQ1208431

Seth J. Teller, Michael E. Hohmeyer

Publication date: 16 May 1993

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

zbMATH Keywords

stabbing lineisothetic rectanglesisothetic boxes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Finding stabbing lines in 3-space

Cites Work

• Unnamed Item
• Detecting the intersection of convex objects in the plane
• Ray shooting on triangles in 3-space
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems

This page was built for publication: Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time