VII.2

Fast Polygon–Cube Intersection Testing

Green Daniel and Hatch Don hatch@sgi.com,     Autodesk — Multimedia Division San Rafael, California; Silicon Graphics, Inc. Mountain View, California. E-mail address: daniel.green@autodesk.com

Overview

This gem generalizes previous triangle–cube intersection methods (Voorhies 1992) to support arbitrary n-gons. Convex, concave, self-intersecting, and degenerate polygons are fully treated, and the new algorithm is more efficient and robust. The implementation uses the C vector macro library vec.h created by the second author ( page 404).

Background

Efficient polygon–cube intersection testing is an important problem in computer graphics. Renderers can profit from fast polygon tests against display ...

Get Graphics Gems V (IBM Version) now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.