Texto completo
Vista Previa |
PDF (Portable Document Format)
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (685kB) | Vista Previa |
Improving shortest paths in the Delaunay triangulation
Cita
Hernández Peñalver, Gregorio 
ORCID: https://orcid.org/0000-0003-1165-0589, Abellanas Oar, Manuel ORCID: https://orcid.org/0000-0001-5043-6417, Claverol, Merce, Hurtado Díaz, Fernando Alfredo, Sacristán Adinolfi, Vera, Saumell Mendiola, Maria and Silveira, Rodrigo Ignacio
(2012).
Improving shortest paths in the Delaunay triangulation.
En: "XIV Spanish Meeting on Computacional Geometry", 27/06/2011 - 30/06/2011, Alcalá de Henares, Madrid. ISBN 0218-1959. pp. 117-120.
Descripción
| Título: | Improving shortest paths in the Delaunay triangulation |
|---|---|
| Autor/es: |
|
| Tipo de Documento: | Ponencia en Congreso o Jornada (Artículo) |
| Título del Evento: | XIV Spanish Meeting on Computacional Geometry |
| Fechas del Evento: | 27/06/2011 - 30/06/2011 |
| Lugar del Evento: | Alcalá de Henares, Madrid |
| Título del Libro: | International journal of computational geometry and applications |
| Fecha: | 2012 |
| ISBN: | 0218-1959 |
| Materias: | |
| ODS: | |
| Escuela: | Facultad de Informática (UPM) [antigua denominación] |
| Departamento: | Matemática Aplicada |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
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 t in the Delaunay triangulation of P u{p} improves as much as possible. We study properties of the problem and give efficient algorithms to find such a point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.
Más información
| ID de Registro: | 19280 |
|---|---|
| Identificador DC: | https://oa.upm.es/19280/ |
| Identificador OAI: | oai:oa.upm.es:19280 |
| URL Oficial: | http://hdl.handle.net/2117/16981 |
| Depositado por: | Memoria Investigacion |
| Depositado el: | 24 Sep 2013 17:33 |
| Ultima Modificación: | 21 Abr 2016 17:32 |
