Update: No need to install and maintain GraphHopper on your own expensive hardware. Sign up to the GraphHopper Directions API for business which makes it very easy, cost effective and reliable to consume GraphHopper routes with always up-to-date software and OpenStreetMap data. On Monday we released version 0.2 of GraphHopper an Open Source road routing […]

Today we’re releasing version 0.2 of our Open Source road routing engine GraphHopper written in 100% Java. Faster! All algorithms are faster due to bug fixes and fine tuning A preparation is necessary for our optional speed-up technique called Contraction Hierarchy. This preparation is also faster. Further! We finally fixed GPS-exact routing so you don’t have […]

Today we’re proud to announce the first stable release of GraphHopper! After over a year of busy development we finally reached version 0.1! GraphHopper is a fast and Open Source road routing engine written in Java based on OpenStreetMap data. It handles the full planet on a 15GB server but is also scales down and […]

I’ve not blogged since a while but we are pushing Java road routing via GraphHopper to its first public release 0.1! We’re not finished yet, but have a first look and give us feedback here or in the mailing list (questions, bugs, …) so that we can release without big surprises in a few days […]

Update: With changes introduced in January 2013 you only need 1GB – live demo! In one of my last blog posts I wrote about memory efficient ways of coding Java. My conclusion was not a bright one for Java: “This time the simplicity of C++ easily beats Java, because in Java you need to operate […]

In Java land there are at least two quadtree implementations which are not yet optimal, so I though I’ll post some possibilities to tune them. Some of those possibilities are already implemented in my GraphHopper project. Quadtree What is a quadtree? Wikipedia says: “A quadtree is a tree data structure in which each internal node […]