Three-clustering of points in the plane.

DOI10.1016/S0925-7721(96)00022-3zbMATH Open1133.68463MaRDI QIDQ2482902FDOQ2482902

Authors: Johann Hagauer, Günter Rote 

Publication date: 25 April 2008

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

Recommendations

• Geometric clusterings
• Clustering to minimize the maximum intercluster distance
• Minimizing the sum of diameters efficiently
• Finding tailored partitions
• Partitioning with two lines in the plane

zbMATH Keywords

DiameterConstraint propagationGeometric clustering

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Maximum spanning trees in normed planes
• Improved algorithms for uniform partitions of points
• Geometric clustering in normed planes
• Some clustering algorithms in normed planes

This page was built for publication: Three-clustering of points in the plane.

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