Abstract
The link distance defined with respect to a planar region R, sets the distance between a pair of points (s, t) in R to be the minimum number of line segments needed to construct a path in R that connects s to t. A path connecting s and t of length equal to the link distance between s and t is called a “minimum link path.” The various applications of the link distance include—robotics/motion planning, communication systems design, placement of telescoping manipulators, and curve compression. A general technique that can be used to solve a number of link path problems consists of a partitioning of the polygon, called a “window partitioning,” into regions of equal link distance from s. To compute a window partition, it is needed to invoke the visibility computations inside P from point s and weak visibility polygon computations from several window edges in P.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
