Browsing by Author "Schnelle, Niklas"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Distributed shortest-path computation
    (2012) Schnelle, Niklas
    We are proposing a technique to distribute the computational load of online route planners like Google/Bing/Nokia Maps between backend servers and clients. We are presenting an implementation integrated in the ToureNPlaner online routing service and its Android client that increases throughput by more than a factor of 8. Based on Contraction Hierarchies we are decreasing the amount of per request computation on backend systems enabling a leaner and less energy hungry infrastructure to be used that scales with IO instead of CPU power.
  • Thumbnail Image
    ItemOpen Access
    Räumliche Kommando-basierte Interaktion mit Kinect
    (2012) Käfer, Verena; Vollmer, Peter; Schnelle, Niklas
    Im Rahmen dieser Fachstudie beschäftigen wir uns mit der Konzeption und Implementierung eines Systems zur Auslösung Computer-basierter Aktionen durch Interaktion mit dem Raum in Form von Körperpositionen. Hierzu besprechen wir insbesondere die Entwicklung eines erweiterbaren Prototypen mit Kinect-basierter Erkennung der Körperhaltung und durch den Benutzer konfigurierbarer Aktions und Auslöserwahl. Zur Evaluierung des Protoypen wurde zudem eine Benutzerstudie durchgeführt in der wir sowohl den Usability Index SUS zur Feststellung der Benutzerfreundlichkeit bestimmen sowie die Frage klären wie die größe der auslösenden Raumbereiche sowie das kurzzeitige Erinnern an ihre Position das Auslöseverhalten verändern.
  • Thumbnail Image
    ItemOpen Access
    Unified routing and map rendering
    (2015) Schnelle, Niklas
    Two major areas worth improving in route planning and the maps accompanying it are customization and routing with limited connectivity. This thesis will tackle both while unifying the mapping and routing aspects in a single always consistent scheme. For this we created an extensible framework based on the Contraction Hierarchy scheme originally developed to speed up routing. This scheme combined with data structures from computational geometry allows us to identify which road segments within a view are most important for routing with a given cost function. Additionally it provides us with a simple yet powerful way to refine roads for rendering at different resolutions and pixel densities. Leading to maps that automatically adapt to both the individual routing scenario and required level of detail. To allow routing under limited connectivity the identified road segments are packaged as self-contained subgraphs. These subgraphs may then be encoded for transfer to the client where they can be combined into larger graphs that can be rendered as a map and routed on.