OPTIMAL LINE BIPARTITIONS OF POINT SETS

DOI10.1142/S0218195999000042zbMath1026.65011OpenAlexW2172070535MaRDI QIDQ4513232

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

convex hullgeometric optimizationbipartitionoptimal line bipartitions

Mathematics Subject Classification ID

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

Related Items (3)

OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM ⋮ Minimum perimeter-sum partitions in the plane ⋮ COVERING A POINT SET BY TWO DISJOINT RECTANGLES

Cites Work

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

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