I have above 2000 points where each point has a field which indicates a number of incidents from 0 to 300. I want to draw a polygon around each of these points where the total number of incidents should be 1000 (with small deviance).

One polygon should cover more than 4 points in order to achieve a minimum sum of 1000.

The distance of the points should be minimal therefore we will have multiple neighboring polygons which has same/similar number of incidents covering multiple points.

Its logically simple and can be done manually but I couldn't find out how to do it automatically.

Thanks in advance.

I have above 2000 points where each point has a field which indicates a number of incidents from 0 to 300. I want to draw a polygon around each of these points where the total number of incidents should be 1000 (with small deviance).

One polygon should cover more than 4 points in order to achieve a minimum sum of 1000.

The distance of the points should be minimal therefore we will have multiple neighboring polygons which has same/similar number of incidents covering multiple points.

Its logically simple and can be done manually but I couldn't find out how to do it automatically.

I have above 2000 points where each point has a field which indicates a number of incidents from 0 to 300. I want to draw a polygons around of these points where total number of incidents should be 1000 (with small deviance)

One polygon should cover more than 4 points in order to achieve minimum sum of 1000.

The distance of each points should be minimal therefore we will have multiple neighboring polygons which has same/similar number of incidents covering multiple points. Its logically simple and can be done manually but couldn't find out how to do it automatically.

thanks in advance.

I have above 2000 points where each point has a field which indicates a number of incidents from 0 to 300. I want to draw a polygon around each of these points where the total number of incidents should be 1000 (with small deviance).

One polygon should cover more than 4 points in order to achieve a minimum sum of 1000.

The distance of the points should be minimal therefore we will have multiple neighboring polygons which has same/similar number of incidents covering multiple points.

Its logically simple and can be done manually but I couldn't find out how to do it automatically.

Thanks in advance.