Reporting intersections among thick objects
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 log n + (D-d/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. (C) 2002 Elsevier Science B.V. All rights reserved.
divide and conquer algorithms computational geometry geometric intersection problems robustness