To access the full text documents, please follow this link: http://hdl.handle.net/2117/9620

Two-convex polygons
Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J.
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta
Polygons
Convex domains
Convex geometry
Triangulation
Algorithms
Polígons
Dominis convexos
Geometria convexa
Triangulacio
Algorismes
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Université Libre de Bruxelles
         

Show full item record

Related documents

Other documents of the same author

Hurtado Díaz, Fernando Alfredo; Merino, C.; Oliveros, D.; Sakai, T.; Urrutia, J.; Ventura, Inmaculada
Abellanas, Manuel; Bose, Prosenjit; García López de Lacalle, Jesús; Hurtado Díaz, Fernando Alfredo; Nicolás, Carlos M.; Ramos, Pedro A.
Aichholzer, Oswin; Fabila-Monroy, Ruy; Hurtado Díaz, Fernando Alfredo; Pérez Lantero, Pablo; Ruiz Vargas, Andrés; Urrutia Galicia, Jorge; Vogtenhuber, Birgit
Aichholzer, Oswin; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Vogtenhuber, Birgit
Aichholzer, Oswin; García Olaverri, Alfredo; Hurtado Díaz, Fernando Alfredo; Tejel Altarriba, F. Javier
 

Coordination

 

Supporters