An efficient algorithm to compute subsets of points in ℤ n

dc.creator	Pacheco Martínez, Ana María
dc.creator	Real Jurado, Pedro
dc.date.accessioned	2015-12-23T11:16:00Z
dc.date.available	2015-12-23T11:16:00Z
dc.date.issued	2012
dc.identifier.uri	http://hdl.handle.net/11441/32166
dc.description.abstract	In this paper we show a more efficient algorithm than that in [8] to compute subsets of points non-congruent by isometries. This algorithm can be used to reconstruct the object from the digital image. Both algorithms are compared, highlighting the improvements obtained in terms of CPU time.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.relation.ispartof	Computational Topology in Image Context, Lecture Notes in Computer Science, Vol. 7309 p. 58-67	es
dc.rights	Atribución-NoComercial-CompartirIgual 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/4.0/	*
dc.subject	digital image	es
dc.subject	grid	es
dc.subject	hypercube	es
dc.subject	isometry	es
dc.subject	n–xel	es
dc.title	An efficient algorithm to compute subsets of points in ℤ n	es
dc.type	info:eu-repo/semantics/bookPart	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)	es
dc.identifier.doi	http://dx.doi.org/10.1007/978-3-642-30238-1_7	es
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/32166

Ficheros	Tamaño	Formato	Ver	Descripción
An efficient algorithm.pdf	1.085Mb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Atribución-NoComercial-CompartirIgual 4.0 Internacional