Finding equitable convex partitions of points in a polygon efficiently

DOI10.1145/1824777.1824792zbMath1298.68275OpenAlexW2141807613MaRDI QIDQ2930354

No author found.

Publication date: 18 November 2014

Published in: (Search for Journal in Brave)

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

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

Related Items (8)

Optimization and operations research in mitigation of a pandemic ⋮ Convex Partitions with 2-Edge Connected Dual Graphs ⋮ Equal-Area Locus-Based Convex Polygon Decomposition ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ Convex partitions with 2-edge connected dual graphs ⋮ Equal-area locus-based convex polygon decomposition ⋮ Dividing a Territory Among Several Vehicles ⋮ BALANCED CONVEX PARTITIONS OF MEASURES IN ℝ ^d

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