Finding tailored partitions

DOI10.1016/0196-6774(91)90013-OMaRDI QIDQ3348447zbMATH OpenOpenAlexFDO

Authors John 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)

Recommendations

• scientific article; zbMATH DE number 4144926
• Partitions
• On partitions
• Adaptive partitioning
• On Refining Partitions
• Partitions of partitions
• Coding partitions

Cited in

(39)

• scientific article; zbMATH DE number 4144926 (Why is no real title available?)
• Optimal line bipartitions of point sets
• Minimum-cost load-balancing partitions
• A fast algorithm for the alpha-connected two-center decision problem
• OPTIMAL LINE BIPARTITIONS OF POINT SETS
• scientific article; zbMATH DE number 177549 (Why is no real title available?)
• Applications of a semi-dynamic convex hull algorithm
• The discrete and mixed minimax 2-center problems
• Three-clustering of points in the plane.
• The mixed center location problem
• A randomized approximation scheme for metric MAX-CUT
• \(\alpha\)-kernel problem with fuzzy visibility
• Improved algorithms for the bichromatic two-center problem for pairs of points
• Minimizing the sum of diameters efficiently
• The Mixed Center Location Problem
• Continuous location of dimensional structures.
• The 2-center problem in three dimensions
• Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
• Efficient \(k\)-center algorithms for planar points in convex position
• A faster algorithm for the two-center decision problem
• Covering convex polygons by two congruent disks
• Covering convex polygons by two congruent disks
• Covering points with convex sets of minimum size
• On some geometric selection and optimization problems via sorted matrices
• A parallel algorithm for partitioning a point set to minimize the maximum of diameters
• EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
• COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
• The discrete and mixed minimax 2-center problem
• Geometric clustering in normed planes
• scientific article; zbMATH DE number 1522945 (Why is no real title available?)
• On some geometric selection and optimization problems via sorted matrices
• Approximating the discrete center line segment in linear time
• On rectangular covering problems
• Computing the coarseness with strips or boxes
• On the planar two-center problem and circular hulls
• Covering a set of points by two axis-parallel boxes
• Some clustering algorithms in normed planes
• Intersecting disks using two congruent disks
• Intersecting disks using two congruent disks

This page was built for publication: Finding tailored partitions

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