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: | , |
---|---|
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 |