Results 1  10
of
16
Spatial Graph Grammars for Graphical User Interfaces
 ACM Transactions on ComputerHuman Interaction
, 2006
"... In a graphical user interface, physical layout and abstract structure are two important aspects of a graph. This article proposes a new graph grammar formalism which integrates both the spatial and structural specification mechanisms in a single framework. This formalism is equipped with a parser th ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
In a graphical user interface, physical layout and abstract structure are two important aspects of a graph. This article proposes a new graph grammar formalism which integrates both the spatial and structural specification mechanisms in a single framework. This formalism is equipped with a parser that performs in polynomial time with an improved parsing complexity over its nonspatial predecessor, that is, the Reserved Graph Grammar. With the extended expressive power, the formalism is suitable for many user interface applications. The article presents its application in adaptive Web design and presentation.
Constraints in graph drawing algorithms
 Constraints
, 1998
"... Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and g ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. Graphs are widely used for information visualization purposes, since they provide a natural and intuitive representation of complex abstract structures. The automatic generation of drawings of graphs has applications a variety of fields such as software engineering, database systems, and graphical user interfaces. In this paper, we survey algorithmic techniques for graph drawing that support the expression and satisfaction of userdefined constraints. 1.
Graph Drawing
 Lecture Notes in Computer Science
, 1997
"... INTRODUCTION Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computeraideddesign. Research on graph drawing has been conducte ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
INTRODUCTION Graph drawing addresses the problem of constructing geometric representations of graphs, and has important applications to key computer technologies such as software engineering, database systems, visual interfaces, and computeraideddesign. Research on graph drawing has been conducted within several diverse areas, including discrete mathematics (topological graph theory, geometric graph theory, order theory), algorithmics (graph algorithms, data structures, computational geometry, vlsi), and humancomputer interaction (visual languages, graphical user interfaces, software visualization). This chapter overviews aspects of graph drawing that are especially relevant to computational geometry. Basic definitions on drawings and their properties are given in Section 1.1. Bounds on geometric and topological properties of drawings (e.g., area and crossings) are presented in Section 1.2. Section 1.3 deals with the time complexity of fundamental graph drawin
The ConstraintBased Layout Framework LayLab and Its Applications
 In Proceedings of ACM Workshop on Effective Abstractions in Multimedia, Layout and Interaction
, 1996
"... this paper, we describe the constraintbased layout framework LayLab that has been developed in the context of the IntelliMedia presentation and design system WIP [ Andr'e et al., 1993; Wahlster ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
this paper, we describe the constraintbased layout framework LayLab that has been developed in the context of the IntelliMedia presentation and design system WIP [ Andr'e et al., 1993; Wahlster
SelfOrganizing Graphs  A Neural Network Perspective of Graph Layout
 In Neural Computers, 393–406, ECKMILLER
, 1998
"... The paper presents selforganizing graphs, a novel approach to graph layout based on a competitive learning algorithm. This method is an extension of selforganization strategies known from unsupervised neural networks, namely from Kohonen's selforganizing map. Its main advantage is that it is very ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The paper presents selforganizing graphs, a novel approach to graph layout based on a competitive learning algorithm. This method is an extension of selforganization strategies known from unsupervised neural networks, namely from Kohonen's selforganizing map. Its main advantage is that it is very flexibly adaptable to arbitrary types of visualization spaces, for it is explicitly parameterized by a metric model of the layout space. Yet the method consumes comparatively little computational resources and does not need any heavyduty preprocessing. Unlike with other stochastic layout algorithms, not even the costly repeated evaluation of an objective function is required. To our knowledge this is the first connectionist approach to graph layout. The paper presents applications to 2Dlayout as well as to 3Dlayout and to layout in arbitrary metric spaces, such as networks on spherical surfaces. 1 Introduction Automatic layout techniques are a crucial component for any application which...
Integration of Declarative Approaches
 In Graph Drawing (GD'96), Berkeley/CA
, 1997
"... This paper and the accompanying demo describe a strategy and a software architecture for integrating several declarative approaches. This architecture allows for the interactive specification of local criteria for each vertex and edge. The Gold ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper and the accompanying demo describe a strategy and a software architecture for integrating several declarative approaches. This architecture allows for the interactive specification of local criteria for each vertex and edge. The Gold
C.: Drawing graphs using modular decomposition
 Graph Drawing. Volume LNCS 3843
, 2005
"... In this paper we present an algorithm for drawing an undirected graph G that takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges in a bottomup fashion u ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper we present an algorithm for drawing an undirected graph G that takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges in a bottomup fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aesthetically pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a wellknown spring embedder algorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n + m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria.
Graph Automata for Linear Graph Languages
, 1996
"... . We introduce graph automata as devices for the recognition of linear graph languages. A graph automaton is the canonical extension of a finite state automaton recognizing a set of connected labeled graphs. It consists of a finite state control and a collection of heads, which search the input ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
. We introduce graph automata as devices for the recognition of linear graph languages. A graph automaton is the canonical extension of a finite state automaton recognizing a set of connected labeled graphs. It consists of a finite state control and a collection of heads, which search the input graph. In a move the graph automaton reads a new subgraph, checks some consistency conditions, changes states and moves some of its heads beyond the read subgraph. It proceeds such that the set of currently visited edges is an edgeseparator between the visited and the yet undiscovered part of the input graph. Hence, the graph automaton realizes a graph searching strategy. Our main result states that finite graph automata recognize exactly the set of graph languages generated by connected linear NCE graph grammars. 1 Introduction The theory of graph languages is based on generative devices, i.e., on graph grammars. A graph grammar consists of a finite set of productions, which are u...
Advances in the Theory and Practice of Graph Drawing
 Theor. Comp. Sci
, 1996
"... The visualization of conceptual structures is a key component of support tools for complex applications in science and engineering. Foremost among the visual representations used are drawings of graphs and ordered sets. In this talk, we survey recent advances in the theory and practice of graph d ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The visualization of conceptual structures is a key component of support tools for complex applications in science and engineering. Foremost among the visual representations used are drawings of graphs and ordered sets. In this talk, we survey recent advances in the theory and practice of graph drawing. Specific topics include bounds and tradeoffs for drawing properties, threedimensional representations, methods for constraint satisfaction, and experimental studies. 1 Introduction In this paper, we survey selected research trends in graph drawing, and overview some recent results of the author and his collaborators. Graph drawing addresses the problem of constructing geometric representations of graphs, a key component of support tools for complex applications in science and engineering. Graph drawing is a young research field that has growth very rapidly in the last decade. One of its distinctive characteristics is to have furthered collaborative efforts between computer scien...