Minimal spanning tree with clustering

calendar_today

15.04.2023

label

Modeling

mouse

Houdini 19.5

Description

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

1 File

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.

2 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

link

Related articles

favorite

138

label

Modeling

Adaptive Resampling of Curves

favorite

283

label

Modeling

Applying Scales to Mesh Surfaces

favorite

226

label

Modeling

Approximating subdivision surfaces

favorite

189

label

Modeling

Blending COPs SDFs into 3D Volume

favorite

272

label

Modeling

Branching Subdivision Curves

favorite

130

label

Modeling

Circuit Networks