Agglomerative clustering of growing squares

DOI10.1007/S00453-021-00873-0MaRDI QIDQ5918473zbMATH OpenOpenAlexFDO

Authors Thom Castermans, Bettina Speckmann, Frank Staals, Kevin Verbeek

Publication date 1 February 2022

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-021-00873-0

zbMATH Keywords

computational geometrykinetic data structuresrange trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Recommendations

• Agglomerative clustering of growing squares
• A practical algorithm for spatial agglomerative clustering
• Geometric algorithms for agglomerative hierarchical clustering
• Analysis of agglomerative clustering
• Clustering motion

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• Agglomerative clustering of growing squares
• Binary Search Trees of Bounded Balance
• Crushing disks efficiently
• Faster algorithms for growing prioritized disks and rectangles
• Growing balls in \(\mathbb{R}^d\)
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Parametrized runtimes for label tournaments

Cited in

(3)

• Growing in time IDLA cluster is recurrent
• A practical algorithm for spatial agglomerative clustering
• Agglomerative clustering of growing squares

This page was built for publication: Agglomerative clustering of growing squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918473)