Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
From MaRDI portal
Publication:1886235
DOI10.1016/j.comgeo.2004.02.001zbMath1060.65026OpenAlexW2000059698MaRDI QIDQ1886235
Sandip Das, Partha P. Goswami, Subhas C. Nandy
Publication date: 18 November 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.02.001
Related Items (8)
Maximum-area and maximum-perimeter rectangles in polygons ⋮ Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set ⋮ Polynomial Time Algorithms for Bichromatic Problems ⋮ Algorithmic enumeration of surrounding polygons ⋮ Computing closest and farthest points for a query segment ⋮ Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
Cites Work
- Unnamed Item
- Unnamed Item
- Range searching with efficient hierarchical cuttings
- The power of geometric duality revisited
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Fractional cascading. II: Applications
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Cutting hyperplanes for divide-and-conquer
- Queries with segments in Voronoi diagrams
- An efficient \(k\) nearest neighbors searching algorithm for a query line.
- Dynamic half-space range reporting and its applications
- Geometric retrieval problems
- Searching and storing similar lists
- Efficiently computing the closest point to a query line
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
- COMPUTING CLOSEST POINTS FOR SEGMENTS
This page was built for publication: Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
