Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set

DOI10.1016/J.IPL.2006.12.010zbMath1184.68599OpenAlexW2076331190MaRDI QIDQ845996

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

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.010

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Chromatic nearest neighbor searching: A query sensitive approach
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set