✦ LIBER ✦

Constructing trees for region description

✍ Scribed by David L. Milgram

Publisher: Elsevier Science
Year: 1979
Weight: 516 KB
Volume: 11
Category: Article
ISSN: 0146-664X
DOI: 10.1016/0146-664x(79)90078-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A self-stabilizing algorithm for constru

A self-stabilizing algorithm for constructing spanning trees

✍ Nian-Shing Chen; Hwey-Pyng Yu; Shing-Tsaan Huang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Cost-optimal parallel algorithms for con

Cost-optimal parallel algorithms for constructing B-trees

✍ Wang Biing-Feng; Chen Gen-Huey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 884 KB

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

An algorithm for constructing edge-trees

An algorithm for constructing edge-trees from hypergraphs

✍ Fǎnicǎ Gavril; Robert Tamari 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

A subquadratic algorithm for constructin

A subquadratic algorithm for constructing approximately optimal binary search trees

✍ Lawrence L Larmore 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 732 KB

Construction of shape description based

Construction of shape description based on tree structural representation of range images

✍ Takao Furukawa; Yoshio Shimizu; Kazuya Sasaki 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 743 KB

This paper discusses a method where the range image is approximated by triangular planar patches using adaptive triangular partitioning (triangulation), as well as a tree structural representation that represents the inclusion relations among the patches and the relations among the patch vertices. T