Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
A linear time exact hidden surface algorithm
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
The excell method for efficient geometric access to data
DAC '82 Proceedings of the 19th Design Automation Conference
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Computational geometry.
Boolean operations of 2-manifolds through vertex neighborhood classification
ACM Transactions on Graphics (TOG)
Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
BRep-Index: a multidimensional space partitioning tree
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Research issues in spatial databases
ACM SIGMOD Record - Directions for future database research & development
Error-free boundary evaluation using lazy rational arithmetic: a detailed implementation
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Solving the Collision Detection Problem
IEEE Computer Graphics and Applications
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
Techniques for Design and Implementation of Efficient Spatial Access Methods
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Efficient octree conversion by connectivity labeling
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
Building solid models from boreholes and user-defined cross-sections
Computers & Geosciences
A Real-Time Algorithm for Accurate Collision Detection for Deformable Polyhedral Objects
Presence: Teleoperators and Virtual Environments
Generic computation of bulletin boards into geometric kernels
AFRIGRAPH '07 Proceedings of the 5th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
| Hi-index | 0.00 |
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.