Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Proceedings on Mathematical Foundations of Computer Science
Concurrent Operations in Large Ordered Indexes
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Efficient algorithms for chordal graphs and interval graphs.
Efficient algorithms for chordal graphs and interval graphs.
PQ-tree algorithms.
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
IEEE Transactions on Computers
Geometric intersection problems
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Sampling-based algorithms for optimal motion planning
International Journal of Robotics Research
| Hi-index | 14.98 |
We present a solution to the problem of reporting and counting all pairs of intersecting or overlapping d-ranges in a given set of n d-ranges. A d-range is a rectilinearly oriented rectangular d-dimensional box or brick. The three-dimensional case is presented in some detail and an 0(n log22n + k) time and 0(n log22n) space algorithm is developed for the