We present an algorithm for detecting intersection between n spheres in three space, which requires O(n log n) space and O(n log 2 n) time.
No takes yet. Share an insight, caveat, or question.
Hopcroft et al. (1983) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: