scholarly journals A tree traversal algorithm for decision problems in knot theory and 3-manifold topology

2011 ◽  
Author(s):  
Benjamin A. Burton ◽  
Melih Ozlen
Keyword(s):  
Knot Theory ◽  
Decision Problems ◽  
Tree Traversal ◽  
Traversal Algorithm

scholarly journals Fast Robust BSP Tree Traversal Algorithm for Ray Tracing

1997 ◽  
Vol 2 (4) ◽  
pp. 15-23 ◽  
Author(s):  
Vlastimil Havran ◽  
Tomas Kopal ◽  
Jiří Bittner ◽  
Jiří Žára
Keyword(s):  
Ray Tracing ◽  
Tree Traversal ◽  
Traversal Algorithm

scholarly journals A bounded-space tree traversal algorithm

1993 ◽  
Vol 47 (4) ◽  
pp. 215-219 ◽  
Author(s):  
D.S. Hirschberg ◽  
S.S. Seiden
Keyword(s):  
Tree Traversal ◽  
Bounded Space ◽  
Traversal Algorithm

scholarly journals Morris' tree traversal algorithm reconsidered

1988 ◽  
Vol 11 (1) ◽  
pp. 29-43
Author(s):  
Prabhaker Mateti ◽  
Ravi Manghirmalani
Keyword(s):  
Tree Traversal ◽  
Traversal Algorithm

A GRAPH MATCHING APPROACH TO 3-D POINT CORRESPONDENCES

1991 ◽  
Vol 05 (03) ◽  
pp. 399-412 ◽  
Author(s):  
JIN-CHANG CHENG ◽  
HON-SON DON
Keyword(s):  
Computer Simulations ◽  
Graph Matching ◽  
Computation Time ◽  
Feature Points ◽  
Data Set ◽  
Rigid Objects ◽  
Tree Traversal ◽  
Motion Parameters ◽  
Set Splitting ◽  
Traversal Algorithm

A recursive descent tree traversal algorithm is presented to find the point correspondences between two views. Given two sets of noisy 3-D feature points on multiple rigid objects at two time-sequential views, the points at the first view are constructed as a graph and then another graph is derived from those feature points at the second view so that a maximal matching point and minimum matching error is obtained. The correspondence of the vertices is then found. The algorithm can also he used when the number of points at two views are different. Therefore, after matching, the occluded points at either view or both views can be identified. The computation time of the proposed algorithm is large when the number of feature points is large. A data set splitting strategy for such cases, which can significantly reduce the computation time, is presented. Another algorithm presented is one in which motion parameters are estimated from a matched subgraph and are then used to guide the matching for the rest of the nodes. Computer simulations are performed to show the efficiency and accuracy of the algorithm.

scholarly journals Picture Segmentation by a Tree Traversal Algorithm

1976 ◽  
Vol 23 (2) ◽  
pp. 368-388 ◽  
Author(s):  
Steven L. Horowitz ◽  
Theodosios Pavlidis
Keyword(s):  
Tree Traversal ◽  
Traversal Algorithm

scholarly journals An Improved Approach for Generating Test Cases during Model-Based Testing Using Tree Traversal Algorithm

2021 ◽  
Vol 14 (06) ◽  
pp. 257-265
Author(s):  
Oluwatolani Achimugu ◽  
Philip Achimugu ◽  
Chinonyelum Nwufoh ◽  
Sseggujja Husssein ◽  
Ridwan Kolapo ◽  
...  
Keyword(s):  
Test Cases ◽  
Model Based ◽  
Model Based Testing ◽  
Tree Traversal ◽  
Traversal Algorithm
Sign in / Sign up

Export Citation Format

Share Document