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

DOI10.1142/S0218195901000602zbMath1074.52506MaRDI QIDQ4682154

Dingyuan Liu, Jiaye Wang, Wenping Wang

Publication date: 10 June 2005

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

zbMATH Keywords

collision detection; intersection; line segment; Polyhedron

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Cites Work

• Test for intersection between plane and box