Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also desc...

Descripción completa

Detalles Bibliográficos
Autores: Fort, Marta, Sellarès i Chiva, Joan Antoni
Tipo de recurso: artículo
Fecha de publicación:2008
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10256/3060
Acceso en línea:http://hdl.handle.net/10256/3060
Access Level:acceso abierto
Palabra clave:Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
id ES_1669706d220b48e5ecec8df8e344a3e3
oai_identifier_str oai:recercat.cat:10256/3060
network_acronym_str ES
network_name_str España
repository_id_str
spelling Computing Distance Functions from Generalized Sources on Weighted Polyhedral SurfacesFort, MartaSellarès i Chiva, Joan AntoniAlgorismes computacionalsGeometria computacionalVoronoi, Polígons deComputer algorithmsPoliedresComputer geometryVoronoi diagramsPolyhedraWe present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagramsIEEE2008info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10256/3060http://hdl.handle.net/10256/3060© International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404Articles publicats (D-IMA)reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)Inglésinfo:eu-repo/semantics/altIdentifier/doi/10.1109/ICCSA.2008.21info:eu-repo/semantics/altIdentifier/isbn/978-0-7695-3243-1Tots els drets reservatsinfo:eu-repo/semantics/openAccessoai:recercat.cat:10256/30602026-05-29T05:05:01Z
dc.title.none.fl_str_mv Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
title Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
spellingShingle Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Fort, Marta
Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
title_short Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
title_full Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
title_fullStr Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
title_full_unstemmed Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
title_sort Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
dc.creator.none.fl_str_mv Fort, Marta
Sellarès i Chiva, Joan Antoni
author Fort, Marta
author_facet Fort, Marta
Sellarès i Chiva, Joan Antoni
author_role author
author2 Sellarès i Chiva, Joan Antoni
author2_role author
dc.subject.none.fl_str_mv Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
topic Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
description We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams
publishDate 2008
dc.date.none.fl_str_mv 2008
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10256/3060
http://hdl.handle.net/10256/3060
url http://hdl.handle.net/10256/3060
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1109/ICCSA.2008.21
info:eu-repo/semantics/altIdentifier/isbn/978-0-7695-3243-1
dc.rights.none.fl_str_mv Tots els drets reservats
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Tots els drets reservats
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv IEEE
publisher.none.fl_str_mv IEEE
dc.source.none.fl_str_mv © International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404
Articles publicats (D-IMA)
reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403854264598528
score 15.228081

Similares en LA Referencia