Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
69.362 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Improving shortest paths in the Delaunay triangulation

Thumbnail
View/Open
delaunay_triangulation.pdf (708,4Kb)
  View UPCommons Usage Statistics
  LA Referencia / Recolecta stats
Includes usage data since 2022
Cita com:
hdl:2117/16981

Show full item record
Abellanas, Manuel
Claverol Aguas, MercèMés informacióMés informacióMés informació
Hernández-Peñalver, Gregorio
Hurtado Díaz, Fernando AlfredoMés informacióMés informació
Sacristán Adinolfi, VeraMés informacióMés informacióMés informació
Saumell Mendiola, Maria
Silveira, Rodrigo IgnacioMés informacióMés informacióMés informació
Document typeArticle
Defense date2012
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
This work is protected by the corresponding intellectual and industrial property rights. Except where otherwise noted, its contents are licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
ProjectMFHQTERRAINS - Mathematical Foundations of High-Quality Terrain Models (EC-FP7-251235)
Abstract
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 ∪ {p}, improves as much as possible. We study several properties of the problem, and give efficient algorithms to find such point when the graph-distance used is Euclidean and for the link-distance. Several other variations of the problem are also discussed.
CitationAbellanas, M. [et al.]. Improving shortest paths in the Delaunay triangulation. "International journal of computational geometry and applications", 2012. 
URIhttp://hdl.handle.net/2117/16981
ISSN0218-1959
Collections
  • DCCG - Grup de recerca en geometria computacional, combinatoria i discreta - Articles de revista [85]
  • Departament de Matemàtiques - Articles de revista [3.480]
  View UPCommons Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
delaunay_triangulation.pdf708,4KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina