A divisive scheme for constructing minimal spanning trees in coordinate space

An algorithm to generate a minimal spanning tree is presented when the nodes with their coordinates in some m-dimensional Euclidean space and the corresponding metric are given. This algorithm is tested on manually generated data sets. The worst case time complexity of this algorithm is O( n log 2 n...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition letters 1990, Vol.11 (6), p.385-389
Main Authors: Choudhury, Sabyasachy, Murty, M.Narasimha
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
intelligent partitioning
minimal spanning tree
Nearest neighbour
Pattern recognition. Digital image processing. Computational geometry
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm to generate a minimal spanning tree is presented when the nodes with their coordinates in some m-dimensional Euclidean space and the corresponding metric are given. This algorithm is tested on manually generated data sets. The worst case time complexity of this algorithm is O( n log 2 n) for a collection of n data samples.
ISSN:0167-8655
1872-7344
DOI:10.1016/0167-8655(90)90108-E