A Dynamic Data Structure to Efficiently Find the Points below a Line and Estimate Their Number

Authors

Bart Kuijpers, UHasselt–Hasselt University and transnational University LimburgFollow
Peter Z. Revesz, University of Nebraska-LincolnFollow

Date of this Version

2017

Citation

ISPRS Int. J. Geo-Inf. 2017, 6, 82; doi:10.3390/ijgi6030082.

Comments

Copyright © 2017, the authors. Licensee MDPI, Basel, Switzerland. Open access, Creative Commons Attribution license 4.0.

Abstract

A basic question in computational geometry is how to find the relationship between a set of points and a line in a real plane. In this paper, we present multidimensional data structures for N points that allow answering the following queries for any given input line: (1) estimate in O(log N) time the number of points below the line; (2) return in O(log N + k) time the k ≤ N points that are below the line; and (3) return in O(log N) time the point that is closest to the line. We illustrate the utility of this computational question with GIS applications in air defense and traffic control.