I have a non-convex hull algorithm that I want to use for an app. With OSM2PO, it's possible to get a convexHull, but is there a way to get the points before the hull is constructed?
More, it would be awesome for me if I can get only the points that are "path end", I mean points that are part of segments that are connected to no more than one other segment.
(If you're intererrested by the non-convex hull algorithm, aka Alpha-shapes, I can share...)
Thanks for your quick answer, but I don't understand well your solution. I've seen this table, and it might be helpfull but I don't see how to query PGSQL (pass it millions indices to check ?) and my aim is to avoid PGSQL.
I'dont know how you dit it but when you traverse the graph, there's probably something that say "Hey stop traversing this branch, you've reached the max cost or this branch has no more points". It should be possible to grab these "last" points, don't you think ?
In order to be sure we understand well, here's a little example.
Imagine this "graph" :
router.getVisited() will give me
My dream : only get
Hope you can help me. Many thanks again.
(sorry for answering my own question but too many chars to be posted as a comment...)