OPTIMAL LINE BIPARTITIONS OF POINT SETS

DOI10.1142/S0218195999000042MaRDI QIDQ4513232zbMATH OpenOpenAlexFDO

Authors Olivier Devillers, Matthew J. Katz

Publication date 7 November 2000

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195999000042

zbMATH Keywords

bipartitionconvex hullgeometric optimizationoptimal line bipartitions

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Optimal line bipartitions of point sets
• scientific article; zbMATH DE number 177549
• Computing a ham-sandwich cut in two dimensions
• Finding tailored partitions
• Partitioning with two lines in the plane

Cites work

• Diameter partitioning
• Finding tailored partitions
• Four results on randomized incremental constructions
• Maintenance of configurations in the plane

Cited in

(10)

• A linear algorithm for bisecting a polygon
• Optimal separable partitioning in the plane
• Minimum perimeter-sum partitions in the plane
• Obnoxious facility location: complete service with minimal harm
• On separating convex points with lines
• Covering a point set by two disjoint rectangles
• Partitioning with two lines in the plane
• scientific article; zbMATH DE number 177549 (Why is no real title available?)
• Olp: An R package for optimal linear partitions of finite sets of points on the plane
• Optimal line bipartitions of point sets

This page was built for publication: OPTIMAL LINE BIPARTITIONS OF POINT SETS

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