Efficiently computing the closest point to a query line

DOI10.1016/S0167-8655(98)00080-4MaRDI QIDQ4226581zbMATH OpenOpenAlexFDO

Authors

Publication date 28 June 1999

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(98)00080-4

zbMATH Keywords

closest pointcomputational geometry

Mathematics Subject Classification ID

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

Recommendations

• Computing closest and farthest points for a query segment
• An efficient \(k\) nearest neighbors searching algorithm for a query line.
• scientific article; zbMATH DE number 1696644
• Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
• COMPUTING CLOSEST POINTS FOR SEGMENTS

Cited in

(9)

• 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
• Computing closest and farthest points for a query segment
• Farthest-point queries with geometric and combinatorial constraints
• Extremal point queries with lines and line segments and related problems
• scientific article; zbMATH DE number 1696644 (Why is no real title available?)
• Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
• Algorithms for computing closest points for segments
• Algorithms for computing closest points for segments

This page was built for publication: Efficiently computing the closest point to a query line

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