Three-clustering of points in the plane.

DOI10.1016/S0925-7721(96)00022-3zbMath1133.68463MaRDI QIDQ2482902

Johann Hagauer, Günter Rote

Publication date: 25 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

DiameterConstraint propagationGeometric clustering

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Geometric clustering in normed planes ⋮ Some clustering algorithms in normed planes ⋮ Maximum spanning trees in normed planes

Cites Work

• Covering convex sets with non-overlapping polygons
• Minimizing the sum of diameters efficiently
• Finding tailored partitions
• Geometric clusterings
• On the shape of a set of points in the plane