Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat de Girona > Documents de recerca > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/10256/3060

dc.contributor.author	Fort, Marta
dc.contributor.author	Sellarès i Chiva, Joan Antoni
dc.date	2010-09-29T10:39:49Z
dc.date	2010-08-10T09:04:46Z
dc.date	2010-09-29T10:39:49Z
dc.date	2008
dc.identifier.citation	Fort, M., i Sellares, J.A. (2008). Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces. International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 394 - 404. Recuperat 28 setembre 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4561244
dc.identifier.citation	978-0-7695-3243-1
dc.identifier.uri	http://hdl.handle.net/10256/3060
dc.format	application/pdf
dc.language.iso	eng
dc.publisher	IEEE
dc.relation	http://dx.doi.org/10.1109/ICCSA.2008.21
dc.relation	Reproducció digital del document publicat a: http://dx.doi.org/10.1109/ICCSA.2008.21
dc.relation	© International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404
dc.relation	Articles publicats (D-IMA)
dc.rights	Tots els drets reservats
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Algorismes computacionals
dc.subject	Geometria computacional
dc.subject	Voronoi, Polígons de
dc.subject	Computer algorithms
dc.subject	Poliedres
dc.subject	Computer geometry
dc.subject	Voronoi diagrams
dc.subject	Polyhedra
dc.title	Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

Fort, Marta; Sellarès i Chiva, Joan Antoni

Polybrominated diphenyl ethers (PBDEs) in breast milk and neuropsychological development in infants

Gascon Merlos, Mireia, 1984-; Fort, Marta; Martínez, David; Carsin, Anne-Elie; Forns i Guzman, Joan, 1981-; Grimalt Obrador, Joan; Santa Marina, Loreto; Lertxundi, Nerea; Sunyer Deu, Jordi; Vrijheid, Martine

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio