Computing directional constrained Delaunay triangulations

This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated t...

ver descrição completa

Detalhes bibliográficos
Autor: Vigo Anglada, Marc|||0000-0001-7412-0425
Formato: informe técnico
Fecha de publicación:1998
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/84373
Acesso em linha:https://hdl.handle.net/2117/84373
Access Level:acceso abierto
Palavra-chave:Constrained Delaunay triangulations
Elliptical distances
Àrees temàtiques de la UPC::Informàtica::Infografia
id ES_53b6a89c8a4cb44a1cdd321005864bdc
oai_identifier_str oai:upcommons.upc.edu:2117/84373
network_acronym_str ES
network_name_str España
repository_id_str
spelling Computing directional constrained Delaunay triangulationsVigo Anglada, Marc|||0000-0001-7412-0425Constrained Delaunay triangulationsElliptical distancesÀrees temàtiques de la UPC::Informàtica::InfografiaThis work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are presented.19981998-03-0120162016-03-15reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/84373reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/843732026-05-27T15:37:01Z
dc.title.none.fl_str_mv Computing directional constrained Delaunay triangulations
title Computing directional constrained Delaunay triangulations
spellingShingle Computing directional constrained Delaunay triangulations
Vigo Anglada, Marc|||0000-0001-7412-0425
Constrained Delaunay triangulations
Elliptical distances
Àrees temàtiques de la UPC::Informàtica::Infografia
title_short Computing directional constrained Delaunay triangulations
title_full Computing directional constrained Delaunay triangulations
title_fullStr Computing directional constrained Delaunay triangulations
title_full_unstemmed Computing directional constrained Delaunay triangulations
title_sort Computing directional constrained Delaunay triangulations
dc.creator.none.fl_str_mv Vigo Anglada, Marc|||0000-0001-7412-0425
author Vigo Anglada, Marc|||0000-0001-7412-0425
author_facet Vigo Anglada, Marc|||0000-0001-7412-0425
author_role author
dc.subject.none.fl_str_mv Constrained Delaunay triangulations
Elliptical distances
Àrees temàtiques de la UPC::Informàtica::Infografia
topic Constrained Delaunay triangulations
Elliptical distances
Àrees temàtiques de la UPC::Informàtica::Infografia
description This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph presented in [Vig97] and [Vig95]. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are presented.
publishDate 1998
dc.date.none.fl_str_mv 1998
1998-03-01
2016
2016-03-15
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/84373
url https://hdl.handle.net/2117/84373
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408135658078208
score 15,300719

Registos relacionados