Minimal spanning tree with clustering

calendar_today

15.04.2023

label

Modeling, Environment

mouse

Houdini 19.5

1 Introduction

A subtractive method of creating minimal spanning tree networks with optional hierarchical clustering.

2 Description

The example file below is sequentially removing edges from a voronoi graph until no more edge can be removed without splitting the tree in separate parts.

3 Source

Entagma released a tutorial series on 'Clustering' by Jeroen Claus showing an additive procedure:
https://entagma.com/courses/advanced-setups/advanced-setups-21-jeroen-claus-hdbscan

download

Downloads