Resumen de Maximum Covered Path within a Region

Manuel Abellanas Oar , Antonio Bajuelos, Inés Matos

• Let S be a set of sensors with a given transmission range r 2 R+. The objective of this paper is to calculate the maximum coverage of a path between two points p and q on a region R. This problem is solved for four cases: R is the line segment pq, R is a planar graph and p and q are two of its nodes, R is a polygonal region containing p and q and, to conclude, R is the whole plane. A maximum covered path between p and q is also found on the second case.