Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces

DOI10.4230/LIPIcs.ISAAC.2017.25zbMath1457.68282arXiv1702.08607OpenAlexW2592001482MaRDI QIDQ5136243

Marcel Roeloffzen, Ade Gunawan, Mark T. de Berg

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1702.08607

zbMATH Keywords

hierarchical clusteringdensity-based clustering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Cites Work

• An O(n log n) algorithm for the all-nearest-neighbors problem
• Euclidean minimum spanning trees and bichromatic closest pairs
• Reporting points in halfspaces
• Higher order Delaunay triangulations
• Geometric Spanner Networks
• Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
• GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces