Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Advanced database indexing
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Spatial Data Structures: Concepts and Design Choices
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Proceedings of the Sixth International Conference on Data Engineering
| Hi-index | 0.01 |
A c-dop is a c-oriented convex polytope, that is, a convex polytope whose edges have orientations that come from a fixed set of c orientations. In this paper we study dop-trees—bounding-volume hierarchies that use c-dops as bounding volumes—in the plane. We prove that for any set S of n disjoint c-dops in the plane, one can construct a dop-tree such that a range query with a c-dop as query range can be answered in O(n1/2+ε+k) time, where k is the number of reported answers. This is optimal up to the factor O(nε). If the c-dops in S may intersect, the query time becomes O(n$^{\rm 1-1/{\it c}}$+k), which is optimal.