Efficiently computing the closest point to a query line

An Efficient k Nearest Neighbor Searching Algorithm for a Query Line

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

An efficient k nearest neighbors searching algorithm for a query line

Theoretical Computer Science

Using simplicial partitions to determine a closest point to a query line

Pattern Recognition Letters

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment

Computational Geometry: Theory and Applications

Farthest-point queries with geometric and combinatorial constraints

Computational Geometry: Theory and Applications

Farthest-point queries with geometric and combinatorial constraints

Computational Geometry: Theory and Applications

Extremal point queries with lines and line segments and related problems

Computational Geometry: Theory and Applications

Computing a closest point to a query hyperplane in three and higher dimensions

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII

Farthest-Point queries with geometric and combinatorial constraints

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry

A simple framework for the generalized nearest neighbor problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory