Abstract
We present an algorithm for detecting intersection between n spheres in three space, which requires O(n log n) space and O(n log2 n) time.
Get full access to this article
View all access options for this article.
References
1.
Edelsbrunner, H.
1982 . Intersection problems in computational geometry. Tech. Rept. F-93 . Graz , Austria: Technical University of Graz .
2.
McCreight, E.M.
1982 (Jan.). Priority search trees. Tech. Rept. CSL-81-5 . Palo Alto, Calif. : Xerox Corporation .
3.
Sharir, M.
1983
(Feb.). Intersection and closest-pair problems for a set of planar bodies. Tech. Rept . 56 . New York : Computer Science Department , Courant Institute , New York University .