Sciweavers

21 search results - page 5 / 5
» The traveling salesman problem for lines and rays in the pla...
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 6 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...