No abstract

No abstract

We are concerned with the problem of partitioning complex scenes of geometric objects in order to support the solutions of proximity problems in general metric spaces with an efficiently computable distance function. We present a data structure Given a scene of n objects in d-dimensional space and some Minkowski-metric. We additionally demand a general position of the objects and that the distance between a point and an object of the scene can be computed in constant time. We show that a Monotonous Bisector* Tree with logarithmic height can be constructed in optimal O(n log u) time using O(n) space. This statement still holds if we demand that the cluster radii, which appear on a path from the root down to a leaf, should generate a geometrically decreasing sequence.We report on extensive experimental results which show that Monotonous Bisector* Trees support a large variety of proximity queries by a single data structure efficiently.

No abstract

No abstract