New lower bounds for the number of straight-edge triangulations of a planar point set

dc.creator	McCabe, Paul	es
dc.creator	Seidel, Raimund	es
dc.date.accessioned	2017-03-06T11:49:23Z
dc.date.available	2017-03-06T11:49:23Z
dc.date.issued	2004
dc.identifier.citation	McCabe, 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.uri	http://hdl.handle.net/11441/55365
dc.description.abstract	We 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.format	application/pdf	es
dc.language.iso	eng	es
dc.relation.ispartof	20th European Workshop on Computational Geometry (2004).
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	New lower bounds for the number of straight-edge triangulations of a planar point set	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
idus.format.extent	2 p.	es
dc.eventtitle	20th European Workshop on Computational Geometry	es
dc.eventinstitution	Sevilla	es

Ficheros	Tamaño	Formato	Ver	Descripción
New lower bounds for the number ...	151.3Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional