Locally Resolvable B-reps
Carlos Gonzalez-Ochoa, George Vaněček · Purdue e-Pubs (Purdue University System) · 1994
A typical B-rep describes a solid in its full detail. Collision detection algorithms that locally analyze the B-rep of non-convex objects usually process the entire B-rep due to the lack of spatial ordering of its topological entities. For very complex objects, this global processing is time consuming. It is also unnecessary. One approach in avoiding the global processing is to use several B-reps of different levels of detail. However, this does not always help. For instance, when objects in close proximity need to be analyzed for contact, the need for a local increase in resolution forces a global increase in detail. Our solution is to unify the different levels of detail and provide the means to locally control them. We introduce a locally resolvable B-rep (LRB-rep) as a non-manifold B-rep data structure with locally varying levels-of-detail for representing complex objects. The LRB-rep locally hides the solid's details with several layers of faces. A subset of all the faces provides...