Results 1 
8 of
8
ThreeDimensional Orthogonal Graph Drawing
, 2000
"... vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv I Orthogonal Graph Drawing 1 1
SketchDriven Orthogonal Graph Drawing
, 2002
"... We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing alg ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal graph drawing.
Visualization of the high level structure of the internet with hermes
 in Computer Science at the Technische Universität München in 1998. In
, 2002
"... Hermes is a system for exploring and visualizing the Internet structure at the level of the Autonomous Systems and their interconnections. It relies on a threetier architecture, on a large repository of routing information coming from heterogeneous sources, and on sophisticated graph drawing engine ..."
Abstract

Cited by 9 (9 self)
 Add to MetaCart
Hermes is a system for exploring and visualizing the Internet structure at the level of the Autonomous Systems and their interconnections. It relies on a threetier architecture, on a large repository of routing information coming from heterogeneous sources, and on sophisticated graph drawing engine. Such an engine exploits static and dynamic graph drawing techniques, specifically devised for the visualization of large graphs with high density.
Minimum depth graph embedding
 Proc. ESA’00, volume 1879 of LNCS
, 2000
"... Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a planar graphs whose biconnected components have a prescribed embedding. 1
Visualizing Software for Telecommunication Services
"... An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. One approach is to rely on a componentbased architecture such as Distributed Feature Composition (DFC), by which a new s ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. One approach is to rely on a componentbased architecture such as Distributed Feature Composition (DFC), by which a new service can be specified as a composition of primitive features over time. Formally, a communication episode is represented by a dynamic graph of software feature boxes, called a usage. This serves as the fundamental model for how services are invoked and how they interact with other services. This paper, after providing some background on DFC, discusses a technique for visualizing the usages which arise through DFC specifications. With the visualization, users can monitor and validate service protocols and feature interactions in real time or through playback logs. The principal display component uses a novel variation of forcedirected layouts for undirected graphs. The resulting graphical interface has become a principal tool for developers building services using DFC.
Accelerated bend minimization
, 2012
"... We present an O(n 3/2) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n 7/4 √ log n) shown by Garg and Tamassia in 1996 could be improved. To answer this question, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present an O(n 3/2) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n 7/4 √ log n) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated mincost flow problem on a planar bidirected graph with bounded costs and face sizes in O(n 3/2) time.
Fully Dynamic Orthogonal Graph Layout for Interactive Systems
, 2000
"... . We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bendnu ..."
Abstract
 Add to MetaCart
. We combine and supplement existing approaches to arrive at a general algorithm for dynamic orthogonal graph drawing with few bends. Our approach is applicable to nonplanar graphs with vertices of arbitrary degree, reduces the number of bends if possible, allows explicit control of the bendnumber/modication tradeo and does not suer from the socalled rotation problem, all of which have been limitations in earlier approaches. 1 Introduction Orthogonal representations are traditionally used for graphs in technical applications like network plans, EntityRelationship diagrams, program dependencies, or circuit schematics. Support software like CASE tools or schema editors typically allows interactive editing of these graphs, but burdens the user with the task to provide a readable layout. Instead of relying on manual placement, an interactive system would ideally oer the kind of transparent layout facilities known from word processing systems that dynamically adjust the for...