Now showing items 1-6 of 6

  • Caminos de desviación mínima local 

    Abellanas, Manuel; Hernández, Gregorio; Sacristán Adinolfi, Vera (U. Zaragoza, 2009)
    Conference report
    Open Access
    Un camino que conecta dos puntos s y t en el plano es de desviación mínima respecto de un conjunto de puntos S si la mayor de las distancias entre un punto del camino y S es la menor posible entre todos los caminos que ...
  • Connecting Red Cells in a Bicolour Voronoi Diagram 

    Abellanas, Manuel; Bajuelos, Antonio L.; Canales, Santiago; Claverol Aguas, Mercè; Hernández, Gregorio; Pereira de Matos, Inés (2012-11)
    Article
    Restricted access - publisher's policy
    Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of the red sites’ weight such that the union of the red ...
  • DVALon: una herramienta para diagramas de Voronoi y grafos de proximidad de alcance limitado 

    Abellanas, Manuel; Hernández, Gregorio; Moreno, José Luis; Ordóñez, Sergio; Sacristán Adinolfi, Vera (Prensas Universitarias de Zaragoza, 2009)
    Conference report
    Open Access
    Presentamos un estudio de los diagramas de Voronoi de alcance limitado de un conjunto finito de puntos del plano y DVALon, una herramienta para la manipulaci´on de dichos diagramas, los grafos de proximidad de alcance ...
  • 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
    Open Access
    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
    Open Access
    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
    Open Access
    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 ...