Computational geometry: an introduction
Computational geometry: an introduction
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Algorithms for proximity problems in higher dimensions
Computational Geometry: Theory and Applications
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
SIAM Journal on Computing
Fast software for box intersections
Proceedings of the sixteenth annual symposium on Computational geometry
Efficient algorithms for line and curve segment intersection using restricted predicates
Computational Geometry: Theory and Applications
Reporting curve segment intersections using restricted predicates
Computational Geometry: Theory and Applications
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
An elementary algorithm for reporting intersections of red/blue curve segments
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |
Let E be a set of n objects in fixed dimension d. We assume that each element of E has diameter smaller than D and has volume larger than V. We give a new divide and conquer algorithm that reports all the intersecting pairs in O(n logn + (Dd/V)(n + k)) time and using O(n) space, where k is the number of intersecting pairs. It makes use of simple data structures and primitive operations, which explains why it performs very well in practice. Its restriction to unit balls in low dimensions is optimal in terms of time complexity, space complexity and algebraic degree.