Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time

DOI10.1007/3-540-60692-0_66zbMath1354.68280OpenAlexW1497536023MaRDI QIDQ2956702

Drago Krznaric, Christos Levcopoulos

Publication date: 19 January 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60692-0_66

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (2)

A fast heuristic for approximating the minimum weight triangulation ⋮ Approximate distance oracles for graphs with dense clusters

This page was built for publication: Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time