A sweep-line algorithm for spatial clustering

DOI10.1016/j.advengsoft.2008.06.003zbMath1161.65311OpenAlexW1969188690MaRDI QIDQ1009933

Krista Rizman Žalik, Borut Žalik

Publication date: 3 April 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.06.003

zbMATH Keywords

algorithmnumerical examplesclusteringspatial datasetsweep-line paradigm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items

Multi-objective evolutionary clustering for large-scale dynamic community detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data mining. Concepts and techniques
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees
• Design and implementation of a practical parallel Delaunay algorithm
• A new approach to clustering data with arbitrary shapes
• Computational Geometry in C
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters