Efficiently computing the closest point to a query line

DOI10.1016/S0167-8655(98)00080-4zbMath0915.68164OpenAlexW2029286260MaRDI QIDQ4226581

No author found.

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

computational geometryclosest point

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Extremal point queries with lines and line segments and related problems

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