COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON

DOI10.1142/S0218195901000602zbMATH Open1074.52506MaRDI QIDQ4682154FDOQ4682154

Authors: Jiaye Wang, Dingyuan Liu, Wenping Wang 

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• Polyhedral line transversals in space
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• A linear algorithm for determining the separation of convex polyhedra
• Finding stabbing lines in 3-space
• scientific article; zbMATH DE number 176771

zbMATH Keywords

intersectioncollision detectionline segmentPolyhedron

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Test for intersection between plane and box

This page was built for publication: COMPUTING AN ALMOST MINIMUM SET OF SPANNING LINE SEGMENTS OF A POLYHEDRON

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