Exploració per autor "Abellanas, Manuel"

Ara es mostren els items 4-6 de 6

    • Improving shortest paths in the Delaunay triangulation 

      Abellanas, Manuel; Claverol Aguas, Mercè; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio (2012)
      Article
      Accés obert
      We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Delaunay triangulation of a point set P, we look for a new point p that can be added, such that the shortest path from s to ...

    • Minimizing the range for k-covered paths on sensor networks 

      Abellanas, Manuel; Bajuelos, Antonio L.; Pereira de Matos, Inés (Wiley Heyden, 2011-08-16)
      Article
      Accés obert
      Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field of wireless sensor networks. The main coverage issue centres around critical conditions that require reliable monitoring ...

    • On structural and graph theoretic properties of higher order Delaunay graphs 

      Abellanas, Manuel; Bose, Prosenjit; García López de Lacalle, Jesús; Hurtado Díaz, Fernando Alfredo; Nicolás, Carlos M.; Ramos, Pedro A. (2009-12)
      Article
      Accés obert
      Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a graph with vertex set $\emph{P}$ and an edge exists between two points p,q ∊ $\emph{P}$ when there is a circle through ...