✦ LIBER ✦

Reconstructing trees from two point deleted subtrees

✍ Scribed by William B. Giles

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 984 KB
Volume: 15
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90046-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing trees from two cards

✍ Manuel Welhan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Let 𝒯 be the class of unlabeled trees. An unlabeled vertex‐deleted subgraph of a tree __T__ is called a card. A collection of cards is called a deck. We say that the tree __T__ has a deck __D__ if each card in __D__ can be obtained by deleting distinct vertices of __T__. If __T__ is the

3D Structure Reconstruction from Point C

3D Structure Reconstruction from Point Correspondences between two Perspective Projections

✍ A. Kara; D.M. Wilkes; K. Kawamura 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 452 KB

An iterative algorithm for 3D structure reconstruction from two perspective projections is proposed. The basis of the method is the eight-point algorithm (Longuet-Higgins, Nature 293(10), 1981, 133-135; Tsai and Huang, IEEE Trans. PAMI 6, 1984, 13-27). A drawback of the eight-point algorithm is that