Show simple item record

dc.contributor.authorHuemer, Clemens
dc.contributor.authorPilz, Alexander
dc.contributor.authorSilveira, Rodrigo Ignacio
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2018-10-24T10:43:01Z
dc.date.issued2018
dc.identifier.citationHuemer, C., Pilz, A., Silveira, R.I. A new lower bound on the maximum number of plane graphs using production matrices. A: European Workshop on Computational Geometry. "EuroCG 2018: 34th European Workshop on Computational Geometry: Berlin, March 21–23, 2018: extended abstracts". 2018, p. 67-72.
dc.identifier.urihttp://hdl.handle.net/2117/122911
dc.description.abstractWe use the concept of production matrices to show that there exist sets of n points in the plane that admit ¿(41.77n) crossing-free geometric graphs. This improves the previously best known bound of ¿(41.18n) by Aichholzer et al. (2007)
dc.format.extent6 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshComputational geometry
dc.titleA new lower bound on the maximum number of plane graphs using production matrices
dc.typeConference lecture
dc.subject.lemacGeometria computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. DCG - Discrete and Combinatorial Geometry
dc.contributor.groupUniversitat Politècnica de Catalunya. CGA -Computational Geometry and Applications
dc.rights.accessRestricted access - publisher's policy
drac.iddocument23335479
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorHuemer, C.; Pilz, A.; Silveira, R.I.
upcommons.citation.contributorEuropean Workshop on Computational Geometry
upcommons.citation.publishedtrue
upcommons.citation.publicationNameEuroCG 2018: 34th European Workshop on Computational Geometry: Berlin, March 21–23, 2018: extended abstracts
upcommons.citation.startingPage67
upcommons.citation.endingPage72


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder