Verification of partitions of 2d and 3d objects

dc.creator	Palios, Leonidas	es
dc.date.accessioned	2017-03-06T11:34:02Z
dc.date.available	2017-03-06T11:34:02Z
dc.date.issued	2004
dc.identifier.citation	Palios, L. (2004). Verification of partitions of 2d and 3d objects. En 20th European Workshop on Computational Geometry, Sevilla.
dc.identifier.uri	http://hdl.handle.net/11441/55360
dc.description.abstract	We consider the problems of deciding whether a given collection of polygons (polyhedra resp.) forms (i) a partition or (ii) a cell complex decomposition of a given polygon (polyhedron resp.). We describe simple O(n log n)-time and O(n)-space algorithms for these problems, where n is the total description size of the input. If, in the input, vertices are referenced by means of indices to an array of distinct vertices, then our cell complex decomposition verification algorithms run in O(n) time.	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	Verification of partitions of 2d and 3d objects	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	4 p.	es
dc.eventtitle	20th European Workshop on Computational Geometry	es
dc.eventinstitution	Sevilla	es

Ficheros	Tamaño	Formato	Ver	Descripción
Verification of partitions of ...	96.66Kb	[PDF]	Ver/Abrir

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