OPTIMAL LINE BIPARTITIONS OF POINT SETS

DOI10.1142/S0218195999000042zbMATH Open1026.65011OpenAlexW2172070535MaRDI QIDQ4513232FDOQ4513232

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 hullbipartitiongeometric optimizationoptimal line bipartitions

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Olp: An R package for optimal linear partitions of finite sets of points on the plane
• Title not available (Why is that?)
• Optimal line bipartitions of point sets
• A linear algorithm for bisecting a polygon
• Minimum perimeter-sum partitions in the plane
• Obnoxious facility location: complete service with minimal harm
• COVERING A POINT SET BY TWO DISJOINT RECTANGLES

   Recommendations

• Optimal line bipartitions of point sets 👍 👎
• Title not available (Why is that?) 👍 👎
• Computing a ham-sandwich cut in two dimensions 👍 👎
• Finding tailored partitions 👍 👎
• Partitioning with two lines in the plane 👍 👎

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)