Vectorized algorithms for quadtree construction and descent

Bibliographic Details
Main Author: Marinho, Eraldo P. [UNESP]
Publication Date: 2012
Other Authors: Baldassin, Alexandro [UNESP]
Format: Conference object
Language: eng
Source: Repositório Institucional da UNESP
Download full: http://dx.doi.org/10.1007/978-3-642-33078-0_6
http://hdl.handle.net/11449/73603
Summary: This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The proposed method of tree construction requires a hash table to index nodes of a linear quadtree in the breadth-first order. The hash is performed in two steps: an internal hash to index child nodes and an external hash to index nodes in the same level (depth). The quadtree descent is performed by considering each level as a vector segment of a linear quadtree, so that nodes of the same level can be processed concurrently. © 2012 Springer-Verlag.
id UNSP_6a89eba682220964b51b47b51e41d089
oai_identifier_str oai:repositorio.unesp.br:11449/73603
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Vectorized algorithms for quadtree construction and descentBreadth-firstChild nodeHash tableIndex nodesLinear quadtreeQuad treesTime complexityTree constructionParallel architecturesAlgorithmsThis paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The proposed method of tree construction requires a hash table to index nodes of a linear quadtree in the breadth-first order. The hash is performed in two steps: an internal hash to index child nodes and an external hash to index nodes in the same level (depth). The quadtree descent is performed by considering each level as a vector segment of a linear quadtree, so that nodes of the same level can be processed concurrently. © 2012 Springer-Verlag.Univ. Estadual Paulista (UNESP) Departamento de Estatística, Matemática Aplicada e Computação IGCE, Rio ClaroUniv. Estadual Paulista (UNESP) Departamento de Estatística, Matemática Aplicada e Computação IGCE, Rio ClaroUniversidade Estadual Paulista (Unesp)Marinho, Eraldo P. [UNESP]Baldassin, Alexandro [UNESP]2014-05-27T11:27:03Z2014-05-27T11:27:03Z2012-10-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject69-82http://dx.doi.org/10.1007/978-3-642-33078-0_6Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7439 LNCS, n. PART 1, p. 69-82, 2012.0302-97431611-3349http://hdl.handle.net/11449/7360310.1007/978-3-642-33078-0_62-s2.0-84866681228Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)0,295info:eu-repo/semantics/openAccess2024-11-27T14:10:27Zoai:repositorio.unesp.br:11449/73603Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462024-11-27T14:10:27Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Vectorized algorithms for quadtree construction and descent
title Vectorized algorithms for quadtree construction and descent
spellingShingle Vectorized algorithms for quadtree construction and descent
Marinho, Eraldo P. [UNESP]
Breadth-first
Child node
Hash table
Index nodes
Linear quadtree
Quad trees
Time complexity
Tree construction
Parallel architectures
Algorithms
title_short Vectorized algorithms for quadtree construction and descent
title_full Vectorized algorithms for quadtree construction and descent
title_fullStr Vectorized algorithms for quadtree construction and descent
title_full_unstemmed Vectorized algorithms for quadtree construction and descent
title_sort Vectorized algorithms for quadtree construction and descent
author Marinho, Eraldo P. [UNESP]
author_facet Marinho, Eraldo P. [UNESP]
Baldassin, Alexandro [UNESP]
author_role author
author2 Baldassin, Alexandro [UNESP]
author2_role author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
dc.contributor.author.fl_str_mv Marinho, Eraldo P. [UNESP]
Baldassin, Alexandro [UNESP]
dc.subject.por.fl_str_mv Breadth-first
Child node
Hash table
Index nodes
Linear quadtree
Quad trees
Time complexity
Tree construction
Parallel architectures
Algorithms
topic Breadth-first
Child node
Hash table
Index nodes
Linear quadtree
Quad trees
Time complexity
Tree construction
Parallel architectures
Algorithms
description This paper presents vectorized methods of construction and descent of quadtrees that can be easily adapted to message passing parallel computing. A time complexity analysis for the present approach is also discussed. The proposed method of tree construction requires a hash table to index nodes of a linear quadtree in the breadth-first order. The hash is performed in two steps: an internal hash to index child nodes and an external hash to index nodes in the same level (depth). The quadtree descent is performed by considering each level as a vector segment of a linear quadtree, so that nodes of the same level can be processed concurrently. © 2012 Springer-Verlag.
publishDate 2012
dc.date.none.fl_str_mv 2012-10-01
2014-05-27T11:27:03Z
2014-05-27T11:27:03Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/conferenceObject
format conferenceObject
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/978-3-642-33078-0_6
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7439 LNCS, n. PART 1, p. 69-82, 2012.
0302-9743
1611-3349
http://hdl.handle.net/11449/73603
10.1007/978-3-642-33078-0_6
2-s2.0-84866681228
url http://dx.doi.org/10.1007/978-3-642-33078-0_6
http://hdl.handle.net/11449/73603
identifier_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7439 LNCS, n. PART 1, p. 69-82, 2012.
0302-9743
1611-3349
10.1007/978-3-642-33078-0_6
2-s2.0-84866681228
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
0,295
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 69-82
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv repositoriounesp@unesp.br
_version_ 1834483600689463296

Similar Items