Author Archives: Uffe Kousgaard

Steiner Tree

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

Posted in RW Net | Comments Off on Steiner Tree

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 | Leave a comment

RouteFinder 5 for MapInfo 64-bit

Here is a first view of the next major release of RouteFinder. It is based upon RW Net 4 and is for 64-bit MapInfo. Follow the roadmap for expected release.

Posted in RouteFinder | Leave a comment

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 | Leave a comment

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 RouteFinder, RW Net | Leave a comment


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 | Leave a comment

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 | Leave a comment

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 | Leave a comment

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 | 2 Comments

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 | Leave a comment