Category Archives: RW Net

Isochrone improvements

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

Posted in RW Net | Comments Off

Alpha shapes

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:

Posted in RW Net | Comments Off

RW Net 4 DLL for MapInfo 64-bit

Pitney Bowes has released an alpha version of their upcoming 64-bit version of MapInfo Professional. We decided to test it with the 64-bit version of RW Net 4 DLL and performed two runs: MapInfo 12.0 > test.mbx > rwnet4.dll (32-bit) … Continue reading

Posted in RW Net | 2 Comments


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

Posted in RW Net | Comments Off

Large drivetime isochrones

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

Posted in RW Net | Comments Off

Alternative routes

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

Posted in RW Net | Comments Off

Spatial Index improvement

A spatial index is key to the routing calculations, since it allows us to convert from real-world coordinates to the internal nodes and links of the street network. Many data structures have been developed for spatial indices and for RW … Continue reading

Posted in RW Net | Comments Off

Minimum Spanning Tree

We have added a minimum spanning tree (MST) algorithm to RW Net 4. This can for instance be used when putting telecommunication cables in the ground, under a road. See an example output below (blue lines are the tree):

Posted in RW Net | Comments Off

Traffic assignment

We have added a new function for calculating traffic flows in RW Net 4. Input is a list of traffic volumes between A to B. Task is to add up all these volumes and get a total flow on each … Continue reading

Posted in RW Net | Comments Off

Loop links in street network

In mathematical graph theory you work with vertices (nodes) and edges (links). An edge normally connects two different vertices or it becomes a loop. RW Net has until now allowed loops. Since loops has several limitations in terms of lack … Continue reading

Posted in FleetEngine, RW Net | Comments Off