Affiliation:
1. Univ. of Oxford, Oxford, UK
2. New York Univ., New York, NY
Abstract
In constructive solid geometry, geometric solids are represented as trees whose leaves are labeled by primitive solids and whose internal nodes are labeled by set-theoretic operations. A
bounding function
in this context is an upper or lower estimate on the extent of the constituent sets; such bounds are commonly used to speed up algorithms based on such trees. We introduce the class of
totally consistent bounding functions
, which have the desirable properties of allowing surprisingly good bounds to be built quickly. Both outer and inner bounds can be refined using a set of rewrite rules, for which we give some complexity and convergence results. We have implemented the refinement rules for outer bounds within a solid modeling system, where they have proved especially useful for intersection testing in three and four dimensions. Our implementations have used boxes as bounds, but different classes (shapes) of bounds are also explored. The rewrite rules are also applicable to relatively slow, exact operations, which we explore for their theoretical insight, and to general Boolean algebras. Results concerning the relationship between these bounds and active zones are also noted.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference14 articles.
1. Boundary evaluation using inner and outer sets: the ISOS method
2. Interactive modeling for design and analysis of solids. 1EEE Comput;BOYSE J. W.;Gr. Appl.,1982
3. A Technical Summary;BROWN C.;IEEE Comput. Gr. Appl.,1982
4. Collision detection by four-dimensional intersection testing;CAMERON S.A;IEEE Trans. Robotics Automation,1990
5. Efficient Intersection Tests for Objects Defined Constructively
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献