Create a search-route in a given area

[opus]

Hi,
I'm trying to auto-generate a seach-route in a given area.
I have an area (for start-up the area will allways be konvex) made up of an array of points (.latitude and .longitude).
In it a route (a sequence of points) has to be created in order that, if the route is followed, the complete area will be covered, the maximum distance between paralel route-legs will also be given.
Does anybody have a routine for something like that?

[opus]

*bump*

Does anybody even have an idea for better keywords to search with?

[NotLKH]

Forget the terminology "search-route", as the human goal is irrelevant.
You wish to create a route that "if the route is followed, the complete area will be covered".

This is probelamtic since a "route" is linear, and consists of points that approach a width of zero.

How can a route cover an area?


You seem to imply this delema by stating "the maximum distance between paralel route-legs will also be given."

Which seems that there might be a radii that, from extension of the route traveled, we might consider that an area is "covered".

Is this a correct observation, and if so, perhaps you could state your problem more succinctly?


For example, "I have an area of N long by M wide, and I wish to travel the smallest distance within that area such that, if I mark all points within r units from wherever I am at at any particular time, once I have traveled my route, all points within the n x m area have been marked"



{[EDIT] I am inclined to consider a rectangular-parallelogram bounded spiral pattern, just from a hunch[/EDIT]}
-Lou

[opus]

Thanks for reply, you are correct with your assumptions. That's what happens when you are to much into a problem, you start thinking everybody else should understand from the spot.
Your example is a good explanation of the problem, however I assume a konvex polygon.
Since I haven't got replys in the .Net forum for 2 days, I put the same topic into the Math forum also!

[opus]

@NotLKH For sure the bounded spiral wil be the solution, my problem is how to write code that will calculate the turnpoints for this spiral.