Partitions of planar point sets into polygons
Computational Geometry
2016-05-19 v1
Abstract
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this problem is equivalent to finding a specified -factor in the visibility graph of the point set. The characterization for the case where all cycles have length also translates to finding a -factor of the visibility graph of the point set. We show that the generalized problem of finding a -factor of the visibility graph of a given point set for is NP-hard.
Cite
@article{arxiv.1605.05546,
title = {Partitions of planar point sets into polygons},
author = {Ajit Arvind Diwan and Bodhayan Roy},
journal= {arXiv preprint arXiv:1605.05546},
year = {2016}
}