Area Queries Based on Voronoi Diagrams
Yang Li

TL;DR
This paper introduces an iterative candidate generation method based on Voronoi diagrams to improve the efficiency of area queries involving irregular shapes, reducing redundant detection and enhancing performance.
Contribution
It proposes a novel Voronoi diagram-based iterative candidate generation approach for more efficient irregular area queries.
Findings
Significant reduction in candidate set size during queries.
Improved query efficiency demonstrated through experiments.
Effective handling of irregular query areas.
Abstract
The area query, to find all elements contained in a specified area from a certain set of spatial objects, is a very important spatial query widely required in various fields. A number of approaches have been proposed to implement this query, the best known of which is to obtain a rough candidate set through spatial indexes and then refine the candidates through geometric validations to get the final result. When the shape of the query area is a rectangle, this method has very high efficiency. However, when the query area is irregular, the candidate set is usually much larger than the final result set, which means a lot of redundant detection needs to be done, thus the efficiency is greatly limited. In view of this issue, we propose a method of iteratively generating candidates based on Voronoi diagrams and apply it to area queries. The experimental results indicate that with our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Geographic Information Systems Studies · Automated Road and Building Extraction
