Category Archives: RW Net

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 →

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):

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 →

After the release of Delphi XE2 and the included 64-bit compiler, we have upgraded RW Net 4 where needed and have had great success doing so: We are now able to create 64-bit applications and the route results are the … Continue reading →

Recently we did a test with a simple routing web service on behalf of a customer. Our aim was to find out how much time a request takes and how many requests can be processed per second. Input is two … Continue reading →

Inspired by a recent post on MapInfo-L about the performance of a competing product, we decided to do a similar calculation with RW Net 4. Task is to create a distance matrix between 230,000 regions in the US. That is … Continue reading →

For a customer we have compiled RW Net 2 with FreePascal WinCE compiler and tested it on a couple of smart devices (HP iPAQ, HTC Touch HD) with Windows Mobile 6.1. Works very well. Expect to find it in next … Continue reading →

Generating large and detailed drivetime isochrones has always been a RAM demanding process in RW Net 2. As part of looking closer at supporting Win64 (using FreePascal compiler), we had to update certain parts of the source code, using pointers. … Continue reading →