scientific article; zbMATH DE number 2089210

MaRDI QIDQ3046479zbMATH OpenFDO

Authors Partha Goswami, Sandip Das, Subhas C. Nandy

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680069.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• Algorithm for finding all \(k\) nearest neighbors
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• scientific article; zbMATH DE number 1696644
• Computing closest and farthest points for a query segment

Cited in

(5)

• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• scientific article; zbMATH DE number 1696644 (Why is no real title available?)
• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments
• Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046479)