I came upon this question in a non GIS-related task, but it really interests me how to do a similar thing in GIS-systems.
- Imagine a random point pattern (see image below)
- Now what i want to have is the maximal number of polygons over the whole area, which:
- enclose a specific number of points (x), which for example could be 4 points
- don't overlap. No polygon should not touch each other!
Possible extension: All polygons have to have equal size
Edit:The shape of the polygons is not important for now. Even Minimum-Convex-Polygons (MCP) are possible.
So some kind of triangulation, which takes the number of points and the position of the resulting polygon into consideration.
Anyone knows of an algorithm to solve this problem?