How can I create an internal spiral for a polygon?

by

this task is extremly hard to do.

  1. need to have the boundary polygon you want to fill with spiral

    I think you have it already

  2. create new smaller polygon by shifting all lines inwards by the step.

    It is similar to create stroke line around polygon. Step is the screw width so at start of polygon it is 0 and on the end it is d

  3. remove invalid lines from the newly generated screw

    Some lines on corners and curvatures will intersect. This is very hard to detect/repair reliably see

  4. repeat (do next screw) … until no space for screw found

    But now after the first screw the step is always d this will not necessarily fill the whole shape. For example if you have some thinner spot on shape it will be filled much more faster then the rest so there can still be some holes left.

    You should detect them and handle as you see fit see

    Be aware detection if the area is filled is also not trivial

This is how this approach looks like:

overview

[Notes]

If you forget about the spiral and want fill the interior with a zig zag or similar pattern then this is not that hard.

Spiral filling makes a lot of hard geometric problems and if you are not skilled in geometry and vector math this task could be a too big challenge for beginner or even medium skilled programmer in this field to make it work properly. That is at least my opinion (as I done this before) so handle it as such.

More Related Contents:

  1. An algorithm for inflating/deflating (offsetting, buffering) polygons
  2. How do I efficiently determine if a polygon is convex, non-convex or complex?
  3. Largest circle inside a non-convex polygon
  4. Sort points in clockwise order?
  5. What is the fastest algorithm to calculate the minimum distance between two sets of points?
  6. How to check if line segment intersects a rectangle?
  7. Polygon enclosing a set of points
  8. What is the most efficient algorithm to find a straight line that goes through most points?
  9. Find if a point is inside a convex hull for a set of points without computing the hull itself
  10. Compute the area of intersection between a circle and a triangle?
  11. Location of highest density on a sphere
  12. How to determine if a point is in a 2D triangle? [closed]
  13. Circle line-segment collision detection algorithm?
  14. How do I calculate the area of a 2d polygon?
  15. Algorithm to detect intersection of two rectangles?
  16. Simple calculations for working with lat/lon and km distance?
  17. Finding whether a point lies inside a rectangle or not
  18. How do you calculate the average of a set of circular data? [closed]
  19. What is an Efficient algorithm to find Area of Overlapping Rectangles
  20. How to Compute OBB of Multiple Curves?
  21. How to compare two shapes?
  22. Combined area of overlapping circles
  23. Geo Fencing – point inside/outside polygon
  24. What is the fastest way to find the closest point to a given point?
  25. Circle-circle intersection points
  26. Find the set of largest contiguous rectangles to cover multiple areas [duplicate]
  27. Sort Four Points in Clockwise Order
  28. How to find convex hull in a 3 dimensional space
  29. Check if polygon is inside a polygon
  30. Calculating the position of points in a circle

Leave a Comment