Finding equitable convex partitions of points in a polygon efficiently

Previous work has developed algorithms for finding an equitable convex partition that partitions the plane into n convex pieces each containing an equal number of red and blue points. Motivated by a vehicle routing heuristic, we look at a related problem where each piece must contain one point and an equal fraction of the area of some convex polygon. We first show how algorithms for solving the older problem lead to approximate solutions for this new equitable convex partition problem. Then we demonstrate a new algorithm that finds an exact solution to our problem in O(N nlog N) time or operations, where n is the number of points, m the number of vertices or edges of the polygon, and N:=n+m the sum.

[1]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[2]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Sergey Bereg,et al.  Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 2000, Discret. Comput. Geom..

[4]  Christos H. Papadimitriou,et al.  On the Optimal Bisection of a Polygon , 1992, INFORMS J. Comput..

[5]  Toshinori Sakai,et al.  Balanced Convex Partitions of Measures in ℝ2 , 2002, Graphs Comb..

[6]  Mitsuo Yokoyama,et al.  2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex Pieces , 1998, JCDCG.

[7]  Kaneko,et al.  Perfect Partitions of Convex Sets in the Plane , 2002 .

[8]  Sergey Bereg,et al.  Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 1999, SCG '99.

[9]  John Gunnar Carlsson,et al.  Solving Min-Max Multi-Depot Vehicle Routing Problem ⁄ , 2007 .

[10]  M. Kano,et al.  Simultaneous Partitions of Measures by K-fans , 2022 .

[11]  Hannah Bast,et al.  The Area Partitioning Problem , 2000, CCCG.

[12]  Jirí Matousek,et al.  Simultaneous partitions of measures by K-fans , 2001, Discret. Comput. Geom..

[13]  Matthew J. Katz,et al.  Minimum-cost load-balancing partitions , 2006, SCG '06.

[14]  David G. Kirkpatrick,et al.  Generalizing Ham Sandwich Cuts to Equitable Subdivisions , 2000 .

[15]  Vladimir J. Lumelsky,et al.  Polygon Area Decomposition for Multiple-Robot Workspace Division , 1998, Int. J. Comput. Geom. Appl..

[16]  Bernhard Nebel,et al.  Dynamic decentralized area partitioning for cooperating cleaning robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[17]  Mikio Kano,et al.  Generalized Balanced Partitions of Two Sets of Points in the Plane , 2000, JCDCG.

[18]  W. A. Beyer,et al.  The Early History of the Ham Sandwich Theorem , 2004, Am. Math. Mon..

[19]  Luc Baronian,et al.  Fredericton, New Brunswick , 2011 .

[20]  Sergey Bereg,et al.  Equitable subdivisions within polygonal regions , 2006, Comput. Geom..