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

DOI10.1007/978-3-540-85126-4_8zbMATH Open1188.68326OpenAlexW1496056286MaRDI QIDQ3628367FDOQ3628367

Authors: 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

Recommendations

• Unobstructed shortest paths in polyhedral environments
• Voronoi diagrams with barriers and on polyhedra for minimal path planning
• The visibility-Voronoi complex and its applications
• The visibility-Voronoi complex and its applications
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

zbMATH Keywords

Voronoi diagram

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Density-Based Clustering Based on Topological Properties of the Data Set

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