Search results
For offline routing, you could use PGRouting. This is an extension to PostgreSQL/PostGIS, but it can be loaded with an OSM file - or even a complete planet.osm file.
9 lip 2012 · I need to find the shortest closed route (taking into account the curvature of the earth). I was thinking I could calculate the distance between each one (using great-circle distance formula) and then list the ones with the shortest distances (that would be 6400 calculations).
16 lut 2024 · The following code example shows us how to calculate the distance between two points with the Euclidean distance formula in C#. using System; namespace measure_distance {. class Program { static void Main(string[] args) { double x1, x2, y1, y2; x1 = 12d;
I've downloaded my regional map from http://download.geofabrik.de/ and now I only want to calculate distance between two point (coordinates) using C#. I've read about BruTile and OSM, but I've no found any piece of code which implements my needs.
14 gru 2017 · var dist = Math.Sqrt(Math.Pow(Point.X - node.Point.X, 2) + Math.Pow(Point.Y - node.Point.Y, 2)); ouch - how about... dX = Point.X - node.Point.X; dY = Point.Y - node.Point.Y; dist = dX * dX + dY * dY; comparing distance squared to another distance squared is valid - why use all these cycles on Sqrt and Pow
28 lut 2024 · Program to calculate distance between two points. Last Updated : 28 Feb, 2024. You are given two coordinates (x1, y1) and (x2, y2) of a two-dimensional graph. Find the distance between them. Examples: Input : x1, y1 = (3, 4) x2, y2 = (7, 7) Output : 5. Input : x1, y1 = (3, 4)
1 cze 2016 · You can use the below formula to find the distance between the 2 points: distance*distance = ((x2 − x1)*(x2 - x1)) + ((y2 − y1)*(y2 - y1))
