Density-Based Clustering Based on Topological Properties of the Data Set

DOI10.1007/978-3-540-85126-4_8zbMath1188.68326OpenAlexW1496056286MaRDI QIDQ3628367

Priyadarshi Bhattacharya, Marina L. Gavrilova

Publication date: 20 May 2009

Published in: Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85126-4_8

zbMATH Keywords

Voronoi diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Randomized incremental construction of Delaunay and Voronoi diagrams
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• The weighted region problem
• COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM
• The visibility--voronoi complex and its applications
• Approximating shortest paths on weighted polyhedral surfaces