The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Set operations on polyhedra using binary space partitioning trees
Open accessAbstract
We introduce a new representation for polyhedra by showing how Binary Space Partitioning Trees (BSP trees) can be used to represent regular sets. We then show how they may be used in evaluating set operations on polyhedra. The BSP tree is a binary tree representing a recursive partitioning of d-space by (sub-)hyperplanes, for any dimension d. Their previous application to computer graphics has been to organize an arbitrary set of polygons so that a fast solution to the visible surface problem could be obtained. We retain this property (in 3D) and show how BSP trees can also provide an exact representation of arbitrary polyhedra of any dimension. Conversion from a boundary representation (B-reps) of polyhedra to a BSP tree representation is described. This technique leads to a new method for evaluating arbitrary set theoretic (boolean) expressions on B-reps, represented as a CSG tree, producing a BSP tree as the result. Results from our language-driven implmentation of this CSG evaluator are discussed. Finally, we show how to modify a BSP tree to represent the result of a set operation between the BSP tree and a B-rep. We describe the embodiment of this approach in an interactive 3D object design program that allows incremental modification of an object with a tool. Placement of the tool, selection of views, and performance of the set operation are all performed at interactive speeds for modestly complex objects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Representations for Rigid Solids: Theory, Methods, and Systems
Requicha, A. G. (1980) · ACM Computing Surveys · doi:10.1145/356827.356833 · Cited by 1,436
Cited by
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
Cohen, J. D., Lin, M. C., Manocha, D., & Ponamgi, M. (1995) · Proceedings of the 1995 symposium on Interactive 3D graphics - SI3D '95 · doi:10.1145/199404.199437 · Cited by 628
3D collision detection: a survey
Jiménez, P., Thomas, F., & Torras, C. (2001) · Computers & Graphics · doi:10.1016/s0097-8493(00)00130-8 · Cited by 563
A rapid hierarchical radiosity algorithm
Hanrahan, P., Salzman, D., & Aupperle, L. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122740 · Cited by 517
Approximating polyhedra with spheres for time-critical collision detection
Hubbard, P. M. (1996) · ACM Transactions on Graphics · doi:10.1145/231731.231732 · Cited by 491
Computer-generated pen-and-ink illustration
Winkenbach, G., & Salesin, D. H. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192184 · Cited by 444
Metadata
- Authors
- Thibault, W. C., & Naylor, B. F.
- Venue
- ACM SIGGRAPH Computer Graphics
- Published
- 1987-08
- Volume
- 21
- Issue
- 4
- Pages
- 153-162
- ISSN
- 0097-8930 (ISSN-L)
- OpenAlex
- W4244064761
- Cited by
- 231
- References
- 1
- FWCI
- 9.49
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Set operations on polyhedra using binary space partitioning trees. https://app.cochat.ai/papers/10.1145/37402.37421
- The paper
- Thibault, W. C., & Naylor, B. F. (1987). Set operations on polyhedra using binary space partitioning trees. ACM SIGGRAPH Computer Graphics. https://doi.org/10.1145/37402.37421
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.