A Dynamic Data Structure to Efficiently Find the Points below a Line and Estimate Their Number
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 )...
Main Authors: | Bart Kuijpers, Peter Z. Revesz |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-03-01
|
Series: | ISPRS International Journal of Geo-Information |
Subjects: | |
Online Access: | http://www.mdpi.com/2220-9964/6/3/82 |
Similar Items
-
SEARCHING AND TRACKING OF LOCATION BY PROXY BASED APPROACH
by: K. Nirmala, et al.
Published: (2017-01-01) -
Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks
by: Yongkoo Han, et al.
Published: (2015-07-01) -
A Unified Approach to Spatial Proximity Query Processing in Dynamic Spatial Networks
by: Hyung-Ju Cho
Published: (2021-08-01) -
Efficient Processing of All Nearest Neighbor Queries in Dynamic Road Networks
by: Aavash Bhandari, et al.
Published: (2021-05-01) -
OPTIMIZATION OF LOCATION BASED QUERIES USING SPATIAL INDEXING
by: S. Geetha, et al.
Published: (2014-04-01)