Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/26660
dc.contributor | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
---|---|
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 | Fabila Monroy, Ruy |
dc.contributor.author | Hackl, Thomas |
dc.contributor.author | Huemer, Clemens |
dc.contributor.author | Pilz, Alexander |
dc.contributor.author | Vogtenhuber, Birgit |
dc.date | 2014-07-01 |
dc.identifier.citation | Aichholzer, O. [et al.]. Lower bounds for the number of small convex k-holes. "Computational geometry: theory and applications", 01 Juliol 2014, vol. 47, núm. 5, p. 605-613. |
dc.identifier.citation | 0925-7721 |
dc.identifier.citation | 10.1016/j.comgeo.2013.12.002 |
dc.identifier.uri | http://hdl.handle.net/2117/26660 |
dc.language.iso | eng |
dc.relation | http://www.sciencedirect.com/science/article/pii/S0925772113001703 |
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 | Discrete geometry |
dc.subject | Combinatorial geometry |
dc.subject | Empty convex polygon |
dc.subject | Erdos-type problem |
dc.subject | Counting |
dc.subject | PLANAR POINT SETS |
dc.subject | EMPTY |
dc.subject | POLYGONS |
dc.subject | THEOREM |
dc.subject | Geometria combinatòria |
dc.title | Lower bounds for the number of small convex k-holes |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/article |
dc.description.abstract |