On some link distance problems in a simple polygon
S Suri - IEEE transactions on Robotics and Automation, 1990 - ieeexplore.ieee.org
IEEE transactions on Robotics and Automation, 1990•ieeexplore.ieee.org
A technique is presented for preprocessing a simple polygon to answer link distance
queries. The preprocessing requires linear time and the time to triangulate the polygon, and
it uses linear storage. As an application of the technique, optimal algorithms for several
fundamental link distance problems are derived.<>
queries. The preprocessing requires linear time and the time to triangulate the polygon, and
it uses linear storage. As an application of the technique, optimal algorithms for several
fundamental link distance problems are derived.<>
A technique is presented for preprocessing a simple polygon to answer link distance queries. The preprocessing requires linear time and the time to triangulate the polygon, and it uses linear storage. As an application of the technique, optimal algorithms for several fundamental link distance problems are derived.< >
ieeexplore.ieee.org
Showing the best result for this search. See all results