Two-dimensional range search based on the Voronoi diagram

Authors:
Takeshi Kanda;Kokichi Sugihara
Affiliations:
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan;Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Year:
2003

Citing 9
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Halfplanar range search in linear space and O(n0.695) query time

Information Processing Letters
New upper bounds for neighbor searching

Information and Control
Geometric range searching

ACM Computing Surveys (CSUR)
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Handbook of discrete and computational geometry

Handbook of discrete and computational geometry
Multidimensional binary search trees used for associative searching

Communications of the ACM
Searching in metric spaces

ACM Computing Surveys (CSUR)
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the two-dimensional range search problem, and constructs a simple and efficient algorithm based on the Voronoi diagram. In this problem, a set of points and a query range are given, and we want to enumerate all the points which are inside the query range as quickly as possible. In most of the previous researches on this problem, the shape of the query range is restricted to particular ones such as circles, rectangles and triangles, and the improvement on the worst-case performance has been pursued. On the other hand, the algorithm proposed in this paper is designed for a general shape of the query range, and is intended to accomplish a good average-case performance. This performance is actually observed by numerical experiments. We can observe that our algorithm shows the better performance in almost all the cases.