CGAL users discussion list

[Sebastien Loriot <>]

What do you mean by "minimum transfer distance"?

Would sorting the polygon lexicographically using their left most point 
sufficient?

Sebastien.


On 2/3/21 12:06 PM, piter wrote:
> Hi everyone,
>
> I'm looking for a way to sort a set of polygons_2 for traversing the whole
> set with the minimum transfer distance.
>
> Checking out the available packages, this one
> (https://doc.cgal.org/latest/Spatial_searching/index.html) and this one
> (https://doc.cgal.org/latest/Spatial_searching/index.html) look promising,
> but I was wondering if someone with more experience could give their
> opinion.
>
> Moreover, as the entering point of each polygon does not need to coincide
> with its first vertex, I was looking into this package
> (https://doc.cgal.org/latest/Polytope_distance_d/index.html#Chapter_Optimal_Distances).
>
> The set of polygons could look something like the following image.
>
> <http://cgal-discuss.949826.n4.nabble.com/file/t376274/ssk.jpg>
>
> Now, this is the output of offsetting the initial polygon (with ssk), and as
> such a way to sort the list could be to look at the skeleton, but I would
> like to set up a more generic approach.
>
> Pietro
>
>
>
> --
> Sent from: http://cgal-discuss.949826.n4.nabble.com/