[Algorithms] Frustum/frustum intersection vs. clipping
Brought to you by:
vexxed72
From: Jim O. <jof...@ni...> - 2005-10-04 15:44:31
|
Hi guys, I need to compute the intersection of two frusta. Actually, I am only interested in the (screen-space) bounding box of the intersection. Since doing the a full boolean intersection is both tedious and expensive, I currently do a double clip; first I clip the polygons of frustum A against all planes of frustum B and then I clip all polygons of B against the planes of frustum A. My back-of-a-napkin maths tell me that the convex hull of all clipped polygons *is* the intersection of frustum A with frustum B. Can anyone of you math-minded types confirm or deny this? Mucho gracias :) -- Jim Offerman Nixxes Software www.nixxes.com / www.jimofferman.nl |