dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2014-05-27T11:27:03Z | |
dc.date.available | 2014-05-27T11:27:03Z | |
dc.date.created | 2014-05-27T11:27:03Z | |
dc.date.issued | 2012-10-01 | |
dc.identifier | 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. | |
dc.identifier | 0302-9743 | |
dc.identifier | 1611-3349 | |
dc.identifier | http://hdl.handle.net/11449/73603 | |
dc.identifier | 10.1007/978-3-642-33078-0_6 | |
dc.identifier | 2-s2.0-84866681228 | |
dc.description.abstract | 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. | |
dc.language | eng | |
dc.relation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.relation | 0,295 | |
dc.rights | Acesso aberto | |
dc.source | Scopus | |
dc.subject | Breadth-first | |
dc.subject | Child node | |
dc.subject | Hash table | |
dc.subject | Index nodes | |
dc.subject | Linear quadtree | |
dc.subject | Quad trees | |
dc.subject | Time complexity | |
dc.subject | Tree construction | |
dc.subject | Parallel architectures | |
dc.subject | Algorithms | |
dc.title | Vectorized algorithms for quadtree construction and descent | |
dc.type | Actas de congresos | |