An efficient \(k\) nearest neighbors searching algorithm for a query line.

DOI10.1016/S0304-3975(02)00322-5zbMath1040.68031MaRDI QIDQ1874395

Sandip Das, Subhas C. Nandy, Partha P. Goswami

Publication date: 25 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

DualityArrangementNearest and farthest neighborQuery line

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (3)

Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment ⋮ The \(k\)-centrum straight-line location problem ⋮ THE ONION DIAGRAM: A VORONOI-LIKE TESSELLATION OF A PLANAR LINE SPACE AND ITS APPLICATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the upper envelope of n line segments in O(n log n) time
• Range searching with efficient hierarchical cuttings
• A deterministic view of random sampling and its use in geometry
• The power of geometric duality revisited
• Fractional cascading. II: Applications
• The widest k-dense corridor problems
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• Optimal Point Location in a Monotone Subdivision
• Efficiently computing the closest point to a query line
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS

This page was built for publication: An efficient \(k\) nearest neighbors searching algorithm for a query line.