ACM SIGGRAPH Computer Graphics · 1987 · 229 citations · 16 references
ComputingComputer ScienceAlgorithmsComputational GeometrySet TheoryBoolean OperationsGeometric Data StructuresBinary TreesCsg Evaluation AlgorithmsCsg Tree RepresentationRecursive PartitioningRegular SetsSet-theoretic Boolean OperationsSpace PartitioningSpace-partitioning Trees
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.
16
Ray casting for modeling solids
Scott D Roth · Computer Graphics and Image Processing · 1982 · 606 citations
Object representation by means of nonminimal division quadtrees and octrees
Dolors Ayala, Pere Brunet, Ricardo Juan et al. · ACM Transactions on Graphics · 1985 · 149 citations · Full text