Mostra el registre d'ítem simple

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
local.identifier.drac23335479
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
local.citation.authorHuemer, C.; Pilz, A.; Silveira, R.I.
local.citation.contributorEuropean Workshop on Computational Geometry
local.citation.publicationNameEuroCG 2018: 34th European Workshop on Computational Geometry: Berlin, March 21–23, 2018: extended abstracts
local.citation.startingPage67
local.citation.endingPage72


Fitxers d'aquest items

Imatge en miniatura

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple