Finding tailored partitions

DOI10.1016/0196-6774(91)90013-OzbMath0726.68077OpenAlexW1969105125MaRDI QIDQ3348447

J. E. Hershberger, Subhash Suri

Publication date: 1991

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(91)90013-o

zbMATH Keywords

partitionscluster analysisNP-completeset measurecircular measurerectangular measuresquare measure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (32)

Improved algorithms for the bichromatic two-center problem for pairs of points ⋮ Covering a set of points by two axis-parallel boxes ⋮ The mixed center location problem ⋮ Geometric clustering in normed planes ⋮ Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ \(\alpha\)-kernel problem with fuzzy visibility ⋮ The Mixed Center Location Problem ⋮ The discrete and mixed minimax 2-center problems ⋮ Approximating the discrete center line segment in linear time ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ Continuous location of dimensional structures. ⋮ The 2-center problem in three dimensions ⋮ Covering points with convex sets of minimum size ⋮ Applications of a semi-dynamic convex hull algorithm ⋮ A faster algorithm for the two-center decision problem ⋮ Minimizing the sum of diameters efficiently ⋮ EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* ⋮ Three-clustering of points in the plane. ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ Some clustering algorithms in normed planes ⋮ Covering convex polygons by two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ Intersecting disks using two congruent disks ⋮ On some geometric selection and optimization problems via sorted matrices ⋮ ON RECTANGULAR COVERING PROBLEMS ⋮ Covering convex polygons by two congruent disks ⋮ On the planar two-center problem and circular hulls ⋮ A randomized approximation scheme for metric MAX-CUT ⋮ OPTIMAL LINE BIPARTITIONS OF POINT SETS ⋮ COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET

This page was built for publication: Finding tailored partitions