Show simple item record

dc.contributor.authorAkman, V.en_US
dc.contributor.authorFranklin, Wm. R.en_US
dc.date.accessioned2016-02-08T10:56:53Z
dc.date.available2016-02-08T10:56:53Z
dc.date.issued1989en_US
dc.identifier.issn1678655
dc.identifier.urihttp://hdl.handle.net/11693/26238
dc.description.abstractk-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.language.isoEnglishen_US
dc.source.titlePattern Recognition Lettersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0167-8655(89)90034-2en_US
dc.subjectHierarchical data structuresen_US
dc.subjectRaysen_US
dc.subjectRepresentation of rigid solidsen_US
dc.subjectStackingen_US
dc.titleRay representation for k-treesen_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage315en_US
dc.citation.epage320en_US
dc.citation.volumeNumber10en_US
dc.citation.issueNumber5en_US
dc.identifier.doi10.1016/0167-8655(89)90034-2en_US
dc.publisherElsevieren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record