Three-clustering of points in the plane.

DOI10.1016/S0925-7721(96)00022-3MaRDI QIDQ2482902zbMATH OpenFDO

Authors Johann Hagauer, Günter Rote

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(96)00022-3

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)

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

Cites work

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

Cited in

(7)

• Geometric clusterings
• Maximum spanning trees in normed planes
• A better heuristic algorithm for finding the closest trio of 3-colored points from a given set of 3-colored points on a plane
• Improved algorithms for uniform partitions of points
• Clustering with few disks to minimize the sum of radii
• 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)