Localized set operations for solid modeling
- 1 July 1983
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 17 (3) , 279-288
- https://doi.org/10.1145/800059.801159
Abstract
Set operation algorithms form an important component of solid modeling systems. Their efficiency can be enhanced by localizing the search for geometric intersections to the region of overlap using a spatial directory. We present an algorithm that employs a three-dimensional extendible cell (EXCELL) directory to the set operation problem, and demonstrate by practical experiments the efficiency and the local nature of the algorithm.Keywords
This publication has 11 references indexed in Scilit:
- Extendible hashing with overflowInformation Processing Letters, 1982
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Geometric modeling using octree encodingComputer Graphics and Image Processing, 1982
- Ray casting for modeling solidsComputer Graphics and Image Processing, 1982
- Representations for Rigid Solids: Theory, Methods, and SystemsACM Computing Surveys, 1980
- A linear time exact hidden surface algorithmACM SIGGRAPH Computer Graphics, 1980
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Eliminating hidden edges in line drawingsComputer-Aided Design, 1979
- A Characterization of Ten Hidden-Surface AlgorithmsACM Computing Surveys, 1974