Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Note: Computing closest and farthest points for a query segment
Theoretical Computer Science
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
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Hi-index | 0.00 |