Clustering: Minimal SpanningTree

20

Clustering: Minimal SpanningTree

• All flagged points are represented by a connected acylic graph such that the sum of the edges is a minimum.
• A cluster is started with just one of the flagged points.
• Neighboring flagged points are added and fitted with a rectangle (cube).

Previous slide

Next slide

Back to the first slide

View Graphic Version

20