Two-convex polygons

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.contributor	Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.author	Aichholzer, Oswin
dc.contributor.author	Aurenhammer, Franz
dc.contributor.author	Hurtado Díaz, Fernando Alfredo
dc.contributor.author	Ramos, Pedro A.
dc.contributor.author	Urrutia, J.
dc.date	2009
dc.identifier.citation	Aichholzer, O. [et al.]. Two-convex polygons. A: European Workshop on Computational Geometry. "25th European Workshop on Computational Geometry". Brussel·les: Université Libre de Bruxelles, 2009, p. 117-120.
dc.identifier.uri	http://hdl.handle.net/2117/9620
dc.language.iso	eng
dc.publisher	Université Libre de Bruxelles
dc.relation	http://2009.eurocg.org/abstracts.pdf
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria convexa i discreta
dc.subject	Polygons
dc.subject	Convex domains
dc.subject	Convex geometry
dc.subject	Triangulation
dc.subject	Algorithms
dc.subject	Polígons
dc.subject	Dominis convexos
dc.subject	Geometria convexa
dc.subject	Triangulacio
dc.subject	Algorismes
dc.title	Two-convex polygons
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	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.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author