Abstract
Efficient computation of surfaces and/or solids intersections is a cornerstone of many algorithms in geometric modelling and computer graphics, for example, set operations between solids, or ray casting display of surfaces. We represent an object centered, information preserving, hierarchical representation for polyhedra called prism tree, establish its fundamental properties, and give a neighbor-finding algorithm. The representation is then used to decompose the intersection algorithms in 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
