[GraphHopper] How to find the near by streets/roads of a point

[Peter K]

Hi George,

sorry, do you have more specific questions? E.g. regarding 2.: dijkstra
algorithm gives you a shortest path tree for one given point with which
you can do lots of things. Probably some animations could visualize the
shortest path tree better for you:
http://karussell.files.wordpress.com/2012/07/astar.gif

Regards,
Peter.

> 1. I read about LocationIdIndex in other threads, mainly the one about
> public transport and the other one about elasticsearch osmosis plugin.
> It will be nice to have the return result with all the surrounding
> roads and streets with names and their start end points.
>
> 2. Limiting Dijkstra algorithm, looking at the code i could see the
> algorithm doing fast/shortcalc between 2 points. in my case i am
>  trying to find the distance one could cover around a point without
> having any particular destination, i.e more like
>  http://www.walkscore.com/score/loc/lat=40.606650590407185/lng=-73.75774383544922 (
> Are you suggesting to provide a big gap between points and see the
> Dijkstra algorithm covering all neighbors for the given duration)
>
> 3. Length of a road line in stages. i.e the route distance of a public
> transport, with individual distance value between every stop.The
> public transport could take any road path not necessarily a short or
> fast path. so i should be able to provide the strict path
> the Graphhopper should take and find the distance covered and time
> taken to cover between stops. ( I  guess it is possible to do it now
> also, but in stages).
>
> 4. OSMReader.isInBounds, seems straight forward.
>
> Thanks for creating Graphhopper
>
>
> On Mon, Jul 15, 2013 at 3:06 AM, Peter K <peathal at yahoo.de
> <mailto:peathal at yahoo.de>> wrote:
>
>     Hi Georg,
>
>     > Given a point is it possible to query the near by roads/streets from
>     graphhopper.
>
>     You can do that via an adapted LocationIDIndex. In a few
>     days/weeks you
>     can directly use this without changing something.
>
>
>     > This is to find something like a walkable/drivable distance from a
>     point given a time duration.
>
>     You could limit calculation in e.g. Dijkstra via the time duration
>     (which will limit the shortest path tree) and then the SPT itself will
>     give you the covered area.
>
>
>     > To look in another perspective, the need is to find the nervous
>     lines
>     of a place.
>
>     What are nervous lines of a place?
>
>
>     > Is it possible to calculate the distance of a line with multiple
>     points in between?
>
>     What do you mean?
>
>
>     > During the graph building process can i selectively index multiple
>     cities while i feed with a whole country osm file.
>
>     You can restrict the boundaries of an indexed area via overriding
>     OSMReader.isInBounds
>
>     Regards,
>     Peter.
>
>     _______________________________________________
>     GraphHopper mailing list
>     GraphHopper at openstreetmap.org <mailto:GraphHopper at openstreetmap.org>
>     http://lists.openstreetmap.org/listinfo/graphhopper
>
>
>
>
> -- 
> Thanks
> George L
>
>
> _______________________________________________
> GraphHopper mailing list
> GraphHopper at openstreetmap.org
> http://lists.openstreetmap.org/listinfo/graphhopper

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/graphhopper/attachments/20130716/73c9760b/attachment.html>