Ray representation for k-trees

Date
1989
Authors
Akman, V.
Franklin, Wm. R.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Pattern Recognition Letters
Print ISSN
1678655
Electronic ISSN
Publisher
Elsevier
Volume
10
Issue
5
Pages
315 - 320
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

k-trees have established themselves as useful data structures in pattern recognition. A fundamental operation regarding k-trees is the construction of a k-tree. We present a method to store an object as a set of rays and an algorithm to convert such a set into a k-tree. The algorithm is conceptually simple, works for any k, and builds a k-tree from the rays very fast. It produces a minimal k-tree and does not lead to intermediate storage swell. © 1989.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)