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

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

 

Advanced Search
 
Opened Access A new 2D tessellation for angle problems: The polar diagram
Cites

Show item statistics
Icon
Export to
Author: Grima Ruiz, Clara Isabel
Márquez Pérez, Alberto
Ortega Alvarado, Lidia
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2006
Published in: Computational Geometry, 34 (2), 58-74.
Document type: Article
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.
Size: 672.3Kb
Format: PDF

URI: http://hdl.handle.net/11441/34393

DOI: http://dx.doi.org/10.1016/j.comgeo.2005.11.004

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)