Show simple item record

Presentation

dc.creatorMcCabe, Paules
dc.creatorSeidel, Raimundes
dc.date.accessioned2017-03-06T11:49:23Z
dc.date.available2017-03-06T11:49:23Z
dc.date.issued2004
dc.identifier.citationMcCabe, P. y Seidel, R. (2004). New lower bounds for the number of straight-edge triangulations of a planar point set. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.urihttp://hdl.handle.net/11441/55365
dc.description.abstractWe present new lower bounds on the number of straight-edge triangulations that every set of n points in plane must have. These bounds are better than previous bounds in case of sets with either many or few extreme points.es
dc.formatapplication/pdfes
dc.language.isoenges
dc.relation.ispartof20th European Workshop on Computational Geometry (2004).
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleNew lower bounds for the number of straight-edge triangulations of a planar point setes
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
idus.format.extent2 p.es
dc.eventtitle20th European Workshop on Computational Geometryes
dc.eventinstitutionSevillaes

FilesSizeFormatViewDescription
New lower bounds for the number ...151.3KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional