On stabbing lines for convex polyhedra in 3D

DOI10.1016/0925-7721(94)90016-7zbMath0813.68156OpenAlexW2128370376MaRDI QIDQ1334608

Pankaj K. Agarwal

Publication date: 25 September 1994

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

Full work available at URL: https://doi.org/10.1016/0925-7721(94)90016-7

zbMATH Keywords

arrangementstransversalsconvex polyhedraPlücker coordinatesstabbing line

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Three-dimensional polytopes (52B10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Improved bound for the Gerver-Ramsey collinearity problem

Cites Work

• Unnamed Item
• Finding stabbing lines in 3-space
• On the zone of a surface in a hyperplane arrangement
• On the sum of squares of cell complexities in hyperplane arrangements
• Castles in the air revisited
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• On the Zone Theorem for Hyperplane Arrangements

This page was built for publication: On stabbing lines for convex polyhedra in 3D