Brandenburg F.J.: Layout Graph Grammars: The Placement Approach. Proceedings 4 th International Workshop on Graph Grammars and their application to Computer Science. LNCS 532. 144-156.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....rewriting programming language. Spider is a prototype system for database programming. Modified, it forms the basis of Grrr, a general purpose programming language, which we are using to explore the notions of visual graph drawing. Graph drawing has been seen in graph rewriting systems previously [4,21]. Our current project is attempting to demonstrate that programming a wide range of graph drawing algorithms is feasible in a graph rewriting visual language. To achieve this we are in the process of producing hierarchical, force directed and planar graph drawing algorithms in Grrr. We note that ....

Brandenburg F.J.: Layout Graph Grammars: The Placement Approach. Proceedings 4 th International Workshop on Graph Grammars and their application to Computer Science. LNCS 532. 144-156.

....for arbitrary directed graphs. CG incorporates techniques to reduce edge crossings, guarantee few bends in long arcs, and to shorten long arcs whenever possible. CG is the first graph drawing tool to use a graph grammar as the fundamental structure that describes the node layout. Brandenburg [1] defines a layout graph grammar as a graph grammar together with a layout specification. The layout specification associates a finite set of layout constraints with each production. Our approach is to classify the productions of the graph parse and associate layout attributes with each production ....

F. J. Brandenburg, "Layout Graph Grammars: the Placement Approach", Lecture Notes in Computer Science, 532, Graph Grammars and Their Application to Computer Science, Springer-Verlag, Berlin, 1991..

....layout objectives can be customized. This is possi 1 This is the draft of a paper to be published at Graph Drawing (GD 98) Montreal, Canada, August 1998. ble with so called declarative methods which can be grouped into two different classes. One class, comprising graph grammar based techniques [Bra91, Bra94], constraint based approaches [HM96] and rule based methods [KMS94] requires some knowledge about the structural properties of the graph, because layout rules have to be specified in terms of structural decomposition. The second class of declarative layout techniques consists of universal ....

F.J. Brandenburg. Layout graph grammars: the placement approach. In Graph Grammars and Their Application to Computer Science, pages 144-- 156, Bremen, Germany, 1991. Springer. LNCS 532.

....grammar and of layout specifications. They layout specifications can consist of things like constraints on relative positions and minimal distances between vertices. A thorough description of how layout graph grammars can be designed and used to produce nice drawings of graphs is presented in [29] and [30] 4.1 Genetic Algorithms An interesting way of generating graph layouts is through the use of genetic algorithms. These are based on the mechanism of genetics and natural selection. The idea is that we should be able to generate a good layout through a simulated evolution process where ....

F. Brandenburg, "Layout Graph Grammars: the Placement Approach", Lecture Notes in Computer Science vol. 532, Springer-Verlag 1991.

....parameters influencing the display of graphs can be adjusted in each window, like the size of node symbols, the zoom factor or the hiding of objects. It is intended to experiment with graph transformation doing the layout manually, before adding layout possibilities to the system. See for example [Bra91] or [NP91] Some edit operations are especially suited for graph transformations, e.g. a gluing operation which merges two objects to a new object inheriting the incidence relations of the original objects and a copy operation drawing edges between all original nodes and edges and their copies. ....

F. Brandenburg, Layout Graph Grammars: The Placement Approach, In Ehrig et al. [EKR91], pp. 144--156.

....and constraints are textually specified using a Prolog like syntax [19] or a set notation [24] Even for small graphs, the enumeration of the constraints can be long and difficult to understand. Layout graph grammars can however draw trees and series parallel digraphs in quadratic time [5]. To avoid leaving the evaluation to a constraint solver, another possibility consists of providing the user with a tool box of algorithmic components, which can be combined in a modular fashion. Steps have been taken in this direction by Diagram Server [13, 3] where algorithmic components are ....

F. Brandenburg. Layout Graph Grammars: the Placement Approach. In GraphGrammars and their Application to Comp. Sc.. LNCS 532, Springer Verlag, 1991.

....parsing as the fundamental structure that describes the node layout for a general directed graph. Graph grammar researchers have described schemes for graph layout that are similar to ours, but difficulties in graph grammar parsing have inhibited their implementation. In particular, Brandenburg [1] defines a layout graph grammar as a graph grammar together with a layout specification. The layout specification associates a finite set of layout constraints with each production. Assigning intrinsic attributes to the parse tree nodes and defining procedures for computing inherited and ....

F. J. Brandenburg, "Layout Graph Grammars: the Placement Approach", Lecture Notes in Computer Science, 532, Graph Grammars and Their Application to Computer Science, Springer-Verlag, Berlin, 1991..

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC