Sciweavers

219 search results - page 16 / 44
» Drawing with Fat Edges
Sort
View
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
COMPGEOM
2009
ACM
14 years 6 days ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
GD
2006
Springer
13 years 11 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren
IV
2003
IEEE
148views Visualization» more  IV 2003»
14 years 24 days ago
Real-Time Expressive Rendering of City Models
City models have become central elements for visually communicating spatial information related to urban areas and have manifold applications. Our real-time orealistic rendering t...
Jürgen Döllner, Maike Walther
JEA
2010
94views more  JEA 2010»
13 years 2 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...