Abstract

The goal of this work is to improve speed of searching for intersection of a point, line segment, rectangle, etc. with a group of bounding-boxes in 2D. In case of successive passing of bounding-boxes one by one, the complexity is O(n). Our work present a way with complexity O(log(n)). One of many algorithms that we call ``Insert algorithm'' is described in details, the others are mentioned only marginally.

KEYWORDS: clustering, cluster analysis, computational geometry.