STORYTELLING
2007
Springer
14 years 5 months ago
2007
Springer
STORYTELLING
2007
Springer
14 years 5 months ago
2007
Springer
Storytelling capabilities are vital aspect of a tour guide. In this paper, we present a mobile tour guide that emulates a real guide’s behaviour by presenting stories based on th...
GIS
2007
ACM
14 years 5 months ago
2007
ACM
In this paper, we present a technique that generalizes 3D building groups of virtual 3D city models according to a cell structure that is derived from infrastructure networks. In ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
GD
2007
Springer
14 years 5 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
GD
2007
Springer
14 years 5 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
GD
2007
Springer
14 years 5 months ago
2007
Springer
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
GD
2007
Springer
14 years 5 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
GD
2007
Springer
14 years 5 months ago
2007
Springer
GD
2007
Springer
14 years 5 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...