On the Computational Complexity of Partitioning Weighted Points into a Grid of Quadrilaterals


In the paper the computational complexity of the following partitioning problem is studied: Given a rectangle R in the plane, a set Q of positive-weighted points in R, and two positive integers n1, n2, find a partitioning of R into quadrilaterals whose dual graph is an n1 × n2 grid such that each quadrilateral contains points of equal total weight. If such… (More)


8 Figures and Tables