Maximum Covered Path within a Region

• Manuel Abellanas ^[1] ; Antonio Bajuelos ^[2] ; Inés Matos ^[2]
  1. [1] Universidad Politécnica de Madrid

     Universidad Politécnica de Madrid

     Madrid, España

     
  2. [2] Universidade de Aveiro

     Universidade de Aveiro

     Vera Cruz, Portugal

     
• Localización: XIII Encuentros de Geometría Computacional: Zaragoza, del 29 de junio al 1 de julio de 2009 / Alfredo García Olaverri (ed. lit.) , Javier Tejel Altarriba (ed. lit.) , 2009, ISBN 978-84-92774-11-1, págs. 277-284
• Idioma: español
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.