Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere

DOI10.1007/978-3-642-22006-7_65zbMath1333.68292OpenAlexW138469690MaRDI QIDQ3012849

Hu Ding, Jinhui Xu

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_65

zbMATH Keywords

high dimensioncore-setchromatic cone clustering

Mathematics Subject Classification ID

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

Related Items (10)

Improved algorithms for the bichromatic two-center problem for pairs of points ⋮ Connectivity graphs of uncertainty regions ⋮ On Clustering Induced Voronoi Diagrams ⋮ Improved PTAS for the constrained \(k\)-means problem ⋮ Unnamed Item ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ On Geometric Prototype and Applications ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ Bichromatic 2-center of pairs of points ⋮ A unified framework for clustering constrained data without locality property

Cites Work

• The upper envelope of Voronoi surfaces and its applications
• On the complexity of some geometric problems in unbounded dimension
• Farthest-Polygon Voronoi Diagrams
• Approximate clustering via core-sets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere