Tree traversal

Known as: Inorder walk, Converse Postorder, Pre-order traversal 
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Modern graphics hardware architectures excel at compute-intensive tasks such as ray-triangle intersection, making them attractive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N nodes, our… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The extraction of the centerlines of tubular objects in two and three-dimensional images is a part of many clinical image… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
In this paper we propose algorithms for generation of frequent itemsets by successive construction of the nodes of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
For 2D or 3D meshes that represent a continuous function to the reals, the contours—or isosurfaces-of a specified value are an… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A fast and simple voxel traversal algorithm through a 3D space partition is introduced. Going from one voxel to its neighbour… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1980
Highly Cited
1980
This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 9
Is this relevant?
Highly Cited
1976
Highly Cited
1976
In the past, picture segmentation has been performed by merging small primitive regions or by recursively splitting the whole… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?