Provides a way to map real world data "lat,lon" to internal ids/indices of a memory efficient graph - often just implemented as an array.
We need the supercover line.
Very slow O(n) LocationIndex but no RAM/disc required.
Same as full index but calculates distance to all edges too
This implementation implements an n-tree to get the closest node or edge from GPS coordinates.
Result of LocationIndex lookup.
Due to precision differences it is hard to define when something is exactly 90?? or "on-node" like TOWER or PILLAR or if it is more "on-edge" (EDGE).
Copyright © 2012–2016. All rights reserved.