Prism Trees: An Efficient Representation for Manipulating and Displaying Polyhedra with Many Faces.
MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
Pagination or Media Count:
Computing surface andor object intersections is a cornerstone of many algorithms in Geometric Modelling and Computer Graphic, for example Set Operations between solids, or surfaces Ray Casting display. This document presents an object centered, information preserving, hierarchical representation for polyhedra called Prism Tree. The author uses the representation to decompose the intersection algorithms into two steps the localization of intersections, and their processing. When dealing with polyhedra with many faces typically more than one thousand, the first step is by far the most expensive. The Prism Tree structure is used to compute efficiently this localization step. A preliminary implementation of the Set Operations and Ray Casting algorithms has been constructed. Author
- Theoretical Mathematics