Repositorio de producción científica de la Universidad de Sevilla

A new 2D tessellation for angle problems: The polar diagram


Advanced Search

Show simple item record

dc.creator Grima Ruiz, Clara Isabel
dc.creator Márquez Pérez, Alberto
dc.creator Ortega Alvarado, Lidia 2016-02-09T11:56:44Z 2016-02-09T11:56:44Z 2006
dc.description.abstract The new approach we propose in this paper is a plane partition with similar features to those of the Voronoi Diagram, but the Euclidean minimum distance criterion is replaced for the minimal angle criterion. The result is a new tessellation of the plane in regions called Polar Diagram, in which every site is owner of a polar region as the locus of points with smallest polar angle respect to this site. We prove that polar diagrams, used as preprocessing, can be applied to many problems in Computational Geometry in order to speed up their processing times. Some of these applications are the convex hull, visibility problems, and path planning problems. es
dc.format application/pdf es
dc.language.iso eng es
dc.relation.ispartof Computational Geometry, 34 (2), 58-74. es
dc.rights Attribution-NonCommercial-NoDerivatives 4.0 Internacional *
dc.rights.uri *
dc.title A new 2D tessellation for angle problems: The polar diagram es
dc.type info:eu-repo/semantics/article es
dc.type.version info:eu-repo/semantics/publishedVersion es
dc.rights.accessrights info:eu-repo/semantics/openAccess es
dc.contributor.affiliation Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) es
dc.identifier.doi es
dc.journaltitle Computational Geometry es
dc.publication.volumen 34 es
dc.publication.issue 2 es
dc.publication.initialPage 58 es
dc.publication.endPage 74 es
Size: 672.3Kb
Format: PDF

This item appears in the following Collection(s)

Show simple item record