Finding tailored partitions

DOI10.1016/0196-6774(91)90013-OzbMATH Open0726.68077OpenAlexW1969105125MaRDI QIDQ3348447FDOQ3348447

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

Recommendations

• scientific article
• Partitions
• On partitions
• Adaptive partitioning
• On Refining Partitions
• Partitions of partitions
• Coding partitions

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)

Cited In (39)

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

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)