Category Archives: RW Net

We have created a new demo to show how it is possible to connect to a routing server, where the it runs over the gRPC protocol. The client demo is a .NET 7 Core application, which you can download from … Continue reading →

A GeoBarrier allows you to prevent spatial searches to find roads on the “wrong” side of a barrier, even if a road there is nearer. A geobarrier can be either lines or polygons. In the example below, the nearest road … Continue reading →

A GeoPackage is an open and standardized local geographical database, based upon the SQLite format. We have just added a new method, so you can import directly from this file format. Compared to importing from a TAB file (large network … Continue reading →

We have added a new method for Steiner Tree’s, which deals with the problem of connecting points on a network with the shortest possible set of links, so there is a path between all points. Like when you install pipelines … Continue reading →

We have just implemented a number of low-level performance improvements of the simple isochrones (method DriveTimeSimpleDyn), so they are generated faster, particularly in large networks and when they have multiple steps. This is done by using the spatial index as … Continue reading →

We have come a long way with adding alpha shapes as one more way of doing polygon isochrones in RW Net 4. The example below shows a 5 km isochrone, based upon OpenStreetMap data:

After several low-level fixes and changes, we have now managed to get RW Net 4 running on an Android device. It is the exact same .NET assembly that you also use with Visual Studio and Windows. The application below was … Continue reading →

For the municipality of Næstved we have calculated drive time isochrones showing the effect of the Fixed link at Femern Belt, scheduled to open in 2021 and connecting Germany and Eastern Denmark. Calculations were done with RW Net 4, OpenStreetMap … Continue reading →

We have been making experiments on calculating alternative routes, as can be seen on the map below: Here we have 4 routes, the fastest (green) and then 3 alternatives. 1, 2 and 3 are mostly overlapping. It will be included … Continue reading →