Updated line generalization thresholds
First implementation of Tarjans seminal SCC algorithm. The iterative
version was coded by brute force.
Fixing warning detected by additional compiler flags
Replacing old style casts and unsafe float comparison
Iterator based CRC32 computation. Fixes issues #388, #414 and
potentially a few other.
Output of used CRC32 method more verbose
Refactoring extraction stuff
Const'ing a member function
Partially fixes issue #339
Fixes issue #294
Routing datastructure more seperated from data of original edges
Removing include dependencies
Adding a number of explicit namespace declarations
API Breaking change. Location of nodes can be specified by a hint.
PhantomNodes get transmitted as well. The client is supposed to send us
this information whenever it's possible.
Merge branch 'master' of
Typo in CRC32 data length
Adding new class to compute CRC32 of a char array
Replace recursive unpacking procedure by a stack'ed implementation.
Renaming function to have a more obvious name.
Moving Bresenhams algorithm to the Algorithms subdirectory
Threshold for Douglas-Peucker fixed
Removed debug code
Linestring is generalized by an untuned (Ramer-)Douglas-Peucker
algorithm. Distance computation is still a naive implementation and can
be further sped up if necessary
Added some minor code formatting
Moved pure algorithms to /Algorithms sub directory