25 citations · 38 across the 7 of their papers we have counts for
8 papers
Implementation Note 2: Approximating a Smooth Three-Dimensional Function on a Coarse Lattice
Dennis Luxen
A smooth 3D function can be efficiently and accurately approximated by a 3D lookup table of significantly lower resolution combined with tetrahedral interpolation. The function is…
An Inverse Olympic Medal Tally Transformation for Optimal Lane-level Road Network Path Traversal
Dennis Luxen
Lane-level traversal of (almost) arbitrary input paths is a common problem in the mapping industry. This paper considers the problem of generating \emph{feasible} and maximally con…
Transit Node Routing Reconsidered
Julian Arz, Dennis Luxen, Peter Sanders
Transit Node Routing (TNR) is a fast and exact distance oracle for road networks. We show several new results for TNR. First, we give a surprisingly simple implementation fully bas…
Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing
Dennis Luxen, Dennis Schieferdecker
Contraction Hierarchies is a successful speedup-technique to Dijkstra's seminal shortest path algorithm that has a convenient trade-off between preprocessing and query times. We in…
Efficient Error-Correcting Geocoding
Christian Jung, Daniel Karch, Sebastian Knopp +2
We study the problem of resolving a perhaps misspelled address of a location into geographic coordinates of latitude and longitude. Our data structure solves this problem within a…
Compressed Transmission of Route Descriptions
Gernot Veit Batz, Robert Geisberger, Dennis Luxen +1
We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges.…