Mmh,
you are looking not for the next node on a way but the nearest? In
that case, you maybe coudl index all OSM nodes in a new layer
ALL_NODES, then fish out the next node on the way, and do a search
for nodes closer that this and check if they are on your way?
Cheers,
/peter neubauer
GTalk:
OK, thanks for this. Unfortunately my project is getting less attention
now than it ever has, but I finally sat down and reworked my
architecture. Instead of working with Neo4J Nodes, I've reworked my
library to use SpatialDatabaseRecord and am now having a bit more success.
I have three more
Fortunately, recent changes seem to have made the memory leaks I was
experiencing a few weeks ago to vanish. Apologies for not playing a more
active part in these discussions, but I'm finding there to be a quite
steep learning curve here, and I don't have the time to make a major
push to
Hi Nolan,
I think I can answer a few of your questions. Firstly, some background. The
graph model of the OSM data is based largely on the XML formated OSM
documents, and there you will find 'nodes', 'ways', 'relations' and 'tags'
each as their own xml-tag, and as a consequence each will also have
4 matches
Mail list logo
