On Clustering Induced Voronoi Diagrams

DOI10.1137/15M1044874zbMath1380.68390OpenAlexW2768030941MaRDI QIDQ4593247

Danny Z. Chen, Yangwei Liu, Ziyun Huang, Jinhui Xu

Publication date: 22 November 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1044874

zbMATH Keywords

clusteringinfluence functionVoronoi diagramclustering induced Voronoi diagramapproximate influence decomposition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Small candidate set for translational pattern search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the map of geometric minimal cuts
• A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters
• 2-point site Voronoi diagrams
• The Hausdorff Voronoi diagram of point clusters in the plane
• On 2-site Voronoi diagrams under geometric distance functions
• Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
• Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
• On the Triangle-Perimeter Two-Site Voronoi Diagram
• Fast Algorithms for Classical Physics
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Space-efficient approximate Voronoi diagrams
• Generalization of Voronoi Diagrams in the Plane
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Power Diagrams: Properties, Algorithms and Applications
• GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING