Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces
From MaRDI portal
Publication:5234039
DOI10.1142/S0218195919400028zbMath1457.68281OpenAlexW3020965650MaRDI QIDQ5234039
Marcel Roeloffzen, Ade Gunawan, Mark T. de Berg
Publication date: 9 September 2019
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195919400028
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces
