Computational geometry: an introduction
Computational geometry: an introduction
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Efficiently computing the closest point to a query line
Pattern Recognition Letters
Computational geometry and convexity
Computational geometry and convexity
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
A simple framework for the generalized nearest neighbor problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.10 |
In this note we show that simplicial partitions can be used to answer the following queries efficiently: given a point set in the plane, determine a point that is closest to an arbitrary query line. We also propose an alternate scheme that is very practical and easy to implement.