Finding equitable convex partitions of points in a polygon efficiently

DOI10.1145/1824777.1824792MaRDI QIDQ2930354zbMATH OpenOpenAlexFDO

Authors John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1824777.1824792

zbMATH Keywords

computational geometryvehicle routing

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Traffic problems in operations research (90B20)

Recommendations

• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• Equitable subdivisions within polygonal regions
• Convex equipartitions of colored point sets
• Equal-Area Locus-Based Convex Polygon Decomposition

Cited in

(13)

• Optimization and operations research in mitigation of a pandemic
• Equitable subdivisions within polygonal regions
• Dividing a territory among several vehicles
• Algorithms for fair partitioning of convex polygons
• Balanced convex partitions of measures in \(\mathbb R^{d}\)
• Equal-Area Locus-Based Convex Polygon Decomposition
• Convex Partitions with 2-Edge Connected Dual Graphs
• Minimum Linear Arrangement of Generalized Sierpinski Graphs
• Convex partitions with 2-edge connected dual graphs
• Minimum-cost load-balancing partitions
• Algorithms for fair partitioning of convex polygons
• The equipartition of curves
• Equal-area locus-based convex polygon decomposition

This page was built for publication: Finding equitable convex partitions of points in a polygon efficiently

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