Year: 1991
Type: conference-paper
Abstract: In this paper we introduce the Brep-index, a new multidim.erssionalspace partitioning data structure that pro-~)ides qrslck accr=ssto the vertices, edges and faces of a boundary representation (Brep), thus yielding a single unified representation for polyhedml solids.We describe the construction of the Brep-index and show that its size is Q(v+e+ f), wherev, e, and ~are the number of vertices, edges, and faces of the Brep.The lower bound can be achievedfor some Breps by compressing the structure using simple rewrite rules.We apply the Brep-index to solve the point/solid and the line/solid classification problems, and outline an eficient collision detection algorithm as an example of its use.
Author: George Vaněek
Institution: Purdue University West Lafayette
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W2152200438