In the extension pgRouting of PostgreSQL, there is a family of functions (withPoints) to calculate network distances between arbitrary points and not nodes by temporarily adding points on edges. This option is useful when edges are very long or when targeting short distances (e.g., walking distance).
Would it be feasible in LightOSM?
Using nearest_way is already better than nearest_ node, but the partial distance of the closest edge is not considered.
Thanks.
In the extension pgRouting of PostgreSQL, there is a family of functions (withPoints) to calculate network distances between arbitrary points and not nodes by temporarily adding points on edges. This option is useful when edges are very long or when targeting short distances (e.g., walking distance). Would it be feasible in LightOSM? Using
nearest_wayis already better thannearest_ node, but the partial distance of the closest edge is not considered. Thanks.