Skip to main content
Question

Optimizing Point Placement in an Irregular Polygon with Minimum Distance Constraints

  • June 30, 2024
  • 1 reply
  • 64 views

studentlife
Participant
Forum|alt.badge.img

Hello everyone,

I'm looking to place the maximum number of points within an irregular polygon, ensuring a minimum distance of 250 meters between each point. Initially, I considered using a grid, but I've realized that this method doesn't optimize the space within the polygon very well.

Do you have any suggestions or more effective methods for solving this problem?

Thanks in advance for your help!

1 reply

lifalin2016
Contributor
Forum|alt.badge.img+29
  • Contributor
  • July 12, 2024

The most compact grid of points possible with a 250 meter minimum distance, is a triangular grid with sides of 250 meter. This doesn’t change regardless of how irregular the polygon is.

So the task is more along the lines of how to position such a grid onto the polygon, by shifting and rotating it, to maximize the number of grid nodes inside the polygon.

You may create a custom transformer for the calculation part, having it return the number of grid points, and have the main workspace call this repeatedly with varying parameters for shift and rotation, and select the one with the highest point count.

It’s not a mathematically correct way of doing it, but a practical one.

Hope this helps.


Cookie policy

We use cookies to enhance and personalize your experience. If you accept you agree to our full cookie policy. Learn more about our cookies.

 
Cookie settings