Refinement methods for geometric bounds in constructive solid geometry

Stephen Cameron, Chee Yap

Research output: Chapter in Book/Report/Conference proceedingChapter

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.

Original languageEnglish (US)
Title of host publicationACM Transactions on Graphics
Pages12-39
Number of pages28
Volume11
Edition1
DOIs
StatePublished - Jan 1992

Fingerprint

Geometry
Boolean algebra
Testing

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Cameron, S., & Yap, C. (1992). Refinement methods for geometric bounds in constructive solid geometry. In ACM Transactions on Graphics (1 ed., Vol. 11, pp. 12-39) https://doi.org/10.1145/102377.123764

Refinement methods for geometric bounds in constructive solid geometry. / Cameron, Stephen; Yap, Chee.

ACM Transactions on Graphics. Vol. 11 1. ed. 1992. p. 12-39.

Research output: Chapter in Book/Report/Conference proceedingChapter

Cameron, S & Yap, C 1992, Refinement methods for geometric bounds in constructive solid geometry. in ACM Transactions on Graphics. 1 edn, vol. 11, pp. 12-39. https://doi.org/10.1145/102377.123764
Cameron S, Yap C. Refinement methods for geometric bounds in constructive solid geometry. In ACM Transactions on Graphics. 1 ed. Vol. 11. 1992. p. 12-39 https://doi.org/10.1145/102377.123764
Cameron, Stephen ; Yap, Chee. / Refinement methods for geometric bounds in constructive solid geometry. ACM Transactions on Graphics. Vol. 11 1. ed. 1992. pp. 12-39
@inbook{37bb2da889674210a4415903c00f81f4,
title = "Refinement methods for geometric bounds in constructive solid geometry",
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.",
author = "Stephen Cameron and Chee Yap",
year = "1992",
month = "1",
doi = "10.1145/102377.123764",
language = "English (US)",
volume = "11",
pages = "12--39",
booktitle = "ACM Transactions on Graphics",
edition = "1",

}

TY - CHAP

T1 - Refinement methods for geometric bounds in constructive solid geometry

AU - Cameron, Stephen

AU - Yap, Chee

PY - 1992/1

Y1 - 1992/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026442072&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026442072&partnerID=8YFLogxK

U2 - 10.1145/102377.123764

DO - 10.1145/102377.123764

M3 - Chapter

VL - 11

SP - 12

EP - 39

BT - ACM Transactions on Graphics

ER -