We designed and implemented a simple and fast heuristic for placing multiple labels along edges of a planar network. As a testbed, realworld data from Google Transit is taken: our ...
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Given any > 0 and any planar region bounded by a simple n-gon P we construct a (1 + )-quasiconformal map between and the unit disk in time C()n. One can take C() = C + C log ...
Abstract— Vision systems are used more and more in ’personal’ robots interacting with humans, since semantic information about objects and places can be derived from the rich...
Olaf Booij, Bas Terwijn, Zoran Zivkovic, Ben J. A....
Abstract. This paper introduces a new concept to the processing of graph structured information using self organising map framework. Previous approaches to this problem were limite...
Markus Hagenbuchner, Alessandro Sperduti, Ah Chung...