Time complexity of algorithms that update the Sierpinski-like and modiﬁed Hilbert curves

Please use this identifier to cite or link to this item: http://repositorio.ufla.br/jspui/handle/1/15038

metadata.ojs.dc.title:	Time complexity of algorithms that update the Sierpinski-like and modiﬁed Hilbert curves
metadata.ojs.dc.creator:	Oliveira, Sanderson L. Gonzaga de Kischinhevsky, Maurício
metadata.ojs.dc.subject:	Time complexity Space-filling curves Hilbert-like curve Sierpinski-like curve
metadata.ojs.dc.publisher:	Universidade Federal de Lavras
metadata.ojs.dc.date:	1-Mar-2010
metadata.ojs.dc.identifier.citation:	OLIVEIRA, S. L. G. de; KISCHINHEVSKY, M. Time complexity of algorithms that update the Sierpinski-like and modiﬁed Hilbert curves. INFOCOMP Journal of Computer Science, Lavras, v. 9, n. 1, p. 90-97, Mar. 2010.
metadata.ojs.dc.description:	This paper presents the time complexity of two algorithms that update space-ﬁlling curves of adaptively reﬁned domains. The Modiﬁed Hilbert (space-ﬁlling) Curve was proposed to traverse square-shaped adaptive-reﬁned meshes. Whereas, the Sierpinski-like (space-ﬁlling) Curve was proposed in order to traverse triangular-shaped adaptive-reﬁned meshes. Those curves are variations of the namesimilar well-known space-ﬁlling curves, i.e. the Hilbert Curve and the Sierpinski Curve. Moreover, they ´are adapted from those classical curves that traverse regular discretized domains. This paper describes the asymptotic tight bounds of algorithms that update the Sierpinski-like and the Modiﬁed Hilbert Curves ´ space-ﬁlling curves.
metadata.ojs.dc.language:	eng
Appears in Collections:	Infocomp

Files in This Item:

File	Description	Size	Format
ARTIGO_Time complexity of algorithms that update the Sierpinski-like and modiﬁed Hilbert curves.pdf		618,67 kB	Adobe PDF	View/Open

This item is licensed under a Creative Commons License