Fast Strictly Convex 3D Polygons Overlap Test using Orientation Predicates

Philippe Guigue



This paper presents a fast method for computing whether or not two strictly convex polygons in three dimensions intersect.
The test is a generalization of the scheme used in the three-dimensional
triangle-triangle overlap test and
relies exclusively on the sign of 4 x 4 determinants

Downloadable PostScript File

Last modified: Mon Apr 7 17:34:23 MEST 2003

Philippe Guigue