1. RI UFLA
  2. Revistas UFLA
  3. Infocomp
Use este identificador para citar ou linkar para este item: http://repositorio.ufla.br/jspui/handle/1/15038
Registro completo de metadados
Campo DCValorIdioma
dc.creatorOliveira, Sanderson L. Gonzaga de-
dc.creatorKischinhevsky, Maurício-
dc.date2010-03-01-
dc.date.accessioned2017-08-01T21:08:49Z-
dc.date.available2017-08-01T21:08:49Z-
dc.date.issued2017-08-01-
dc.identifier.citationOLIVEIRA, S. L. G. de; KISCHINHEVSKY, M. Time complexity of algorithms that update the Sierpinski-like and modified Hilbert curves. INFOCOMP Journal of Computer Science, Lavras, v. 9, n. 1, p. 90-97, Mar. 2010.-
dc.identifier.urihttp://repositorio.ufla.br/jspui/handle/1/15038-
dc.descriptionThis paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpinski-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the namesimilar well-known space-filling 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 Modified Hilbert Curves ´ space-filling curves.-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherUniversidade Federal de Lavras-
dc.relationhttp://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/295/280-
dc.rightsCopyright (c) 2016 INFOCOMP Journal of Computer Science-
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceINFOCOMP; Vol 9 No 1 (2010): March, 2010; 90-97-
dc.source1982-3363-
dc.source1807-4545-
dc.subjectTime complexity-
dc.subjectSpace-filling curves-
dc.subjectHilbert-like curve-
dc.subjectSierpinski-like curve-
dc.titleTime complexity of algorithms that update the Sierpinski-like and modified Hilbert curves-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/publishedVersion-
Aparece nas coleções:Infocomp

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
ARTIGO_Time complexity of algorithms that update the Sierpinski-like and modified Hilbert curves.pdf618,67 kBAdobe PDFVisualizar/Abrir
Mostrar registro simples do item Recomendar este item Visualizar estatísticas


Este item está licenciada sob uma Licença Creative Commons Creative Commons