Results 251 to 260 of about 41,749 (283)
Some of the next articles are maybe not open access.
Efficient data-parallel tree-traversal for BlobTrees
CAD Computer Aided Design, 2016The hierarchical implicit modelling paradigm, as exemplified by the BlobTree, makes it possible to support not only Boolean operations and affine transformations, but also various forms of blending and space warping. Typically, the resulting solid is converted to a boundary representation, a triangle mesh approximation, for rendering.
Brian Wyvill, Jarek Rossignac
exaly +2 more sources
Binary apple tree: A game approach to tree traversal algorithms
2012 International Conference on Information Technology Based Higher Education and Training (ITHET), 2012 The computer science students mostly face with the difficulties in learning the topics of algorithms courses. Only listening the topic from the teacher or just writing makes the learning volatile. Instead of listening or writing, if there is something visual, it would be more permanent to learn because visuality increases the learning potential and the
Arafat Şentürk +2 more
exaly +3 more sources
2014
The B-tree , or, more specifically, the B+-tree, is the most widely used physical database structure for primary and secondary indexes on database relations. Because of its balance conditions that must be maintained under all circumstances, the B-tree is a highly dynamic structure in which records are often moved from one page to another in structure ...
Seppo Sippu, Eljas Soisalon-Soininen
openaire +1 more source
The B-tree , or, more specifically, the B+-tree, is the most widely used physical database structure for primary and secondary indexes on database relations. Because of its balance conditions that must be maintained under all circumstances, the B-tree is a highly dynamic structure in which records are often moved from one page to another in structure ...
Seppo Sippu, Eljas Soisalon-Soininen
openaire +1 more source
Vectorization of tree traversals
Journal of Computational Physics, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2008 IEEE Symposium on Interactive Ray Tracing, 2008
This article describes various kd-tree traversal techniques namely: omni-directional ray bundle traversal; cone traversal algorithm and multiple frustum traversal.
John A. Tsakok +2 more
openaire +1 more source
This article describes various kd-tree traversal techniques namely: omni-directional ray bundle traversal; cone traversal algorithm and multiple frustum traversal.
John A. Tsakok +2 more
openaire +1 more source
Fractal Merkle Tree Representation and Traversal
2003Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is maintained by a remote host. We present techniques for authenticating data structures that represent graphs and collections of geometric objects.
Markus Jakobsson +3 more
openaire +1 more source
2018
A tree is a connected acyclic graph and a forest consists of trees. In this chapter, we first describe the tree structure, algorithms to construct a spanning tree of a graph, and tree traversal algorithms. Two main methods of graph traversal are depth-first search and breadth-first search.
openaire +1 more source
A tree is a connected acyclic graph and a forest consists of trees. In this chapter, we first describe the tree structure, algorithms to construct a spanning tree of a graph, and tree traversal algorithms. Two main methods of graph traversal are depth-first search and breadth-first search.
openaire +1 more source
Linguistic Inquiry, 2005
This article looks at how the two-dimensional organization of a syntactic tree is translated into a one-dimensional string. It proposes a method of linearization that extracts the terminal string by visiting the nodes of a tree systematically in a predetermined order, either preorder, inorder, or postorder traversal.
openaire +1 more source
This article looks at how the two-dimensional organization of a syntactic tree is translated into a one-dimensional string. It proposes a method of linearization that extracts the terminal string by visiting the nodes of a tree systematically in a predetermined order, either preorder, inorder, or postorder traversal.
openaire +1 more source
1997
In the preceding section we considered several problems of a similar type: “generate all the elements of some set A”. The scheme used to solve these problems was the following one: A linear ordering on A was imposed and a procedure to generate the next element of A (according to that order) was described.
openaire +1 more source
In the preceding section we considered several problems of a similar type: “generate all the elements of some set A”. The scheme used to solve these problems was the following one: A linear ordering on A was imposed and a procedure to generate the next element of A (according to that order) was described.
openaire +1 more source
Alternative methods for the reconstruction of trees from their traversals
BIT, 1987It is well-known that given the inorder traversal of a binary tree's nodes, along with either one of its preorder or postorder traversals, the original binary tree can be reconstructed using a recursive algorithm. In this short note we provide a short, elegent, iterative solution to this classical problem.
H. A. Burgdorff +3 more
openaire +1 more source