Ray representation for k-trees
| dc.citation.epage | 320 | en_US |
| dc.citation.issueNumber | 5 | en_US |
| dc.citation.spage | 315 | en_US |
| dc.citation.volumeNumber | 10 | en_US |
| dc.contributor.author | Akman, V. | en_US |
| dc.contributor.author | Franklin, Wm. R. | en_US |
| dc.date.accessioned | 2016-02-08T10:56:53Z | |
| dc.date.available | 2016-02-08T10:56:53Z | |
| dc.date.issued | 1989 | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1016/0167-8655(89)90034-2 | en_US |
| dc.identifier.issn | 1678655 | |
| dc.identifier.uri | http://hdl.handle.net/11693/26238 | |
| dc.language.iso | English | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/0167-8655(89)90034-2 | en_US |
| dc.source.title | Pattern Recognition Letters | en_US |
| dc.subject | Hierarchical data structures | en_US |
| dc.subject | Rays | en_US |
| dc.subject | Representation of rigid solids | en_US |
| dc.subject | Stacking | en_US |
| dc.title | Ray representation for k-trees | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Ray_representation_for_k-trees.pdf
- Size:
- 1.6 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version