Parallel algorithms for computing the smallest binary tree size in unit simplex refinement

2018 ◽  
Vol 112 ◽  
pp. 166-178 ◽  
Author(s):  
G. Aparicio ◽  
J.M.G. Salmerón ◽  
L.G. Casado ◽  
R. Asenjo ◽  
E.M.T. Hendrix
Keyword(s):  
Parallel Algorithms ◽  
Binary Tree ◽  
Tree Size ◽  
Unit Simplex

DECODING AND DRAWING ON BSR FOR A BINARY TREE FROM ITS i-p SEQUENCE

1999 ◽  
Vol 09 (01) ◽  
pp. 103-110 ◽  
Author(s):  
Limin XIANG ◽  
Kazuo USHIJIMA
Keyword(s):  
Parallel Algorithms ◽  
Binary Tree ◽  
Constant Time

The i-p sequence is one of the most common encodings for a binary tree. This paper gives constant time BSR parallel algorithms for the decoding and drawing of a binary tree from its i-p sequence respectively.

scholarly journals Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement

2015 ◽  
Vol 33 (2) ◽  
pp. 389-402 ◽  
Author(s):  
J. M. G. Salmerón ◽  
G. Aparicio ◽  
L. G. Casado ◽  
I. García ◽  
E. M. T. Hendrix ◽  
...  
Keyword(s):  
Binary Tree ◽  
Proper Selection ◽  
Unit Simplex ◽  
Selection Of

Multilevel Algebraic Approach for Performance Analysis of Parallel Algorithms

2019 ◽  
Vol 38 (4) ◽  
pp. 817-850 ◽  
Author(s):  
Luisa D'Amore ◽  
Valeria Mele ◽  
Diego Romano ◽  
Giuliano Laccetti
Keyword(s):  
Performance Analysis ◽  
Parallel Algorithms ◽  
Algebraic Approach

Seamless terrain rendering method based on binary tree and GPU

2013 ◽  
Vol 32 (9) ◽  
pp. 2548-2552
Author(s):  
Wei CAO ◽  
Guang-yao DUAN
Keyword(s):  
Binary Tree ◽  
Terrain Rendering
Sign in / Sign up

Export Citation Format

Share Document