A region is partitioned into patches. Consider a given set of patches, and the convex hull of those patches. Define the set of patches to be convex if there are no other patches wholly included in the convex hull that are not in the original set.
Motivation was to impose a convexity constraint in collections of census tracts.
No comments:
Post a Comment