Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295 |
Resumo: | This 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. |
id |
UFLA-5_704f1896b60798d852486d19b0de5ac2 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/295 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curvestime complexityspace-filling curvesHilbert-like CurveSierpinski-like CurveThis 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.Editora da UFLA2010-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 90-971982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295/280Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessOliveira, Sanderson L. Gonzaga deKischinhevsky, Maurício2014-12-09T13:05:17Zoai:infocomp.dcc.ufla.br:article/295Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:30.263744INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
title |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
spellingShingle |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves Oliveira, Sanderson L. Gonzaga de time complexity space-filling curves Hilbert-like Curve Sierpinski-like Curve |
title_short |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
title_full |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
title_fullStr |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
title_full_unstemmed |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
title_sort |
Time Complexity of algorithms that update the Sierpinski-like and Modified Hilbert Curves |
author |
Oliveira, Sanderson L. Gonzaga de |
author_facet |
Oliveira, Sanderson L. Gonzaga de Kischinhevsky, Maurício |
author_role |
author |
author2 |
Kischinhevsky, Maurício |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Oliveira, Sanderson L. Gonzaga de Kischinhevsky, Maurício |
dc.subject.por.fl_str_mv |
time complexity space-filling curves Hilbert-like Curve Sierpinski-like Curve |
topic |
time complexity space-filling curves Hilbert-like Curve Sierpinski-like Curve |
description |
This 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. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/295/280 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 9 No. 1 (2010): March, 2010; 90-97 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740935983104 |