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

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

 

Búsqueda avanzada
 
Opened Access A new 2D tessellation for angle problems: The polar diagram
Citas

Estadísticas
Icon
Exportar a
Autor: Grima Ruiz, Clara Isabel
Márquez Pérez, Alberto
Ortega Alvarado, Lidia
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Fecha: 2006
Publicado en: Computational Geometry, 34 (2), 58-74.
Tipo de documento: Artículo
Resumen: 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.
Tamaño: 672.3Kb
Formato: PDF

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

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

Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones