Range Searching and Point Location among
β
Mark H. Overmars; Frank A. van der Stappen
π
Article
π
1996
π
Elsevier Science
π
English
β 314 KB
We present a data structure that can store a set of disjoint fat objects in d-space such that point location and bounded-size range searching with arbitrarily shaped ranges can be performed efficiently. The structure can deal with either arbitrary Ε½ . Ε½ . fat convex objects or nonconvex fat polytope