Finding stabbing lines in 3-space

DOI10.1007/BF02293043zbMath0776.68111OpenAlexW2101502605MaRDI QIDQ1193706

Peter W. Shor, Marco Pellegrini

Publication date: 27 September 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131216

zbMATH Keywords

upper boundpolyhedracombinatorial complexitystabbing line

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

On stabbing lines for convex polyhedra in 3D ⋮ On lines missing polyhedral sets in 3-space ⋮ Lower bounds on stabbing lines in 3-space

Cites Work

• Stabbing isothetic boxes and rectangles in \(O(n\log n)\) time
• New applications of random sampling in computational geometry
• Polyhedral line transversals in space
• Lines in space: Combinatorics and algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item