Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Proximity graphs inside large weighted graphs

Autor
Ábrego, B.; Fabila, R.; Fernández, S.; Flores, D.; Hurtado, F.; Meijer, H.; Sacristán, V.; Saumell, M.
Tipus d'activitat
Article en revista
Revista
Networks
Data de publicació
2013-01
Volum
61
Número
1
Pàgina inicial
29
Pàgina final
39
DOI
https://doi.org/10.1002/net.21464 Obrir en finestra nova
Resum
Given a weighted graph G = (V,E) and a subset U of V, we define several graphs with vertex set U in which two vertices are adjacent if they satisfy a specific proximity rule. These rules use the shortest path distance in G and generalize the proximity rules that generate some of the most common proximity graphs in Euclidean spaces. We prove basic properties of the defined graphs and provide algorithms for their computation.
Paraules clau
Voronoi diagrams, neighborhood, proximity graphs, weighted graphs
Grup de recerca
CGA -Computational Geometry and Applications
DCG - Discrete and Combinatorial Geometry

Participants

  • Ábrego, Bernardo M.  (autor)
  • Fabila Monroy, Ruy  (autor)
  • Fernández Merchant, Silvia  (autor)
  • Flores Peñazola, David  (autor)
  • Hurtado Diaz, Fernando Alfredo  (autor)
  • Meijer, Henk G. E.  (autor)
  • Sacristán Adinolfi, Vera  (autor)
  • Saumell Mendiola, Maria  (autor)