Fast and Simple Horizontal Coordinate Assignment
type: BookSection
item type: bookSection
is part of: Graph Drawing
  type: Book
  is part of: Lecture Notes in Computer Science
  identifier: ISBN 978-3-540-43309-5 978-3-540-45848-7
publisher: Springer, Berlin, Heidelberg
authors: Person
  surname: Brandes
  givenname: Ulrik
authors: Person
  surname: Köpf
  givenname: Boris
link: Full Text PDF
pages: 31-44
date: 2001/9/23
description: DOI: 10.1007/3-540-45848-4_3
date submitted: 2018-06-09 01:12:32
language: english
abstract: We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well with existing approaches in terms of assignment quality.

Full Text PDF
type: Attachment
item type: attachment
resource: Brandes and Köpf - 2001 - Fast and Simple Horizontal Coordinate Assignment.pdf
date submitted: 2018-06-09 01:12:33
link mode: 1
type: application/pdf

JSON-java: A reference implementation of a JSON package in Java
type: Data
item type: computerProgram
programmers: Person
  surname: Leary
  givenname: Sean
programmers: Person
  surname: Crockford
  givenname: Douglas
rights: MIT
date: 2018-06-08T16:01:34Z
library catalog: GitHub
programming language: Java
short title: JSON-java

Methods for Visual Understanding of Hierarchical System Structures
type: Article
item type: journalArticle
is part of: IEEE Transactions on Systems, Man, and Cybernetics
authors: Person
  surname: Sugiyama
  givenname: K.
authors: Person
  surname: Tagawa
  givenname: S.
authors: Person
  surname: Toda
  givenname: M.
subject: Testing
subject: Computer displays
subject: Constraint theory
subject: Engineering drawings
subject: Flowcharts
subject: Hierarchical systems
subject: Image recognition
subject: Information science
subject: Processor scheduling
subject: Programming
pages: 109-125
date: February 1981
library catalog: IEEE Xplore
abstract: Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods. The methods determine the positions of vertices in two steps. First the order of the vertices in each level is determined to reduce the number of crossings of edges. Then horizontal positions of the vertices are determined to improve further the readability of drawings. The theoretical methods are useful in recognizing the nature of the problem, and the heuristic methods make it possible to enlarge the size of hierarchies with which we can deal. Performance tests of the heuristic methods and several applications are presented.

IEEE Transactions on Systems, Man, and Cybernetics
type: Journal
volume: 11
number: 2
identifier: ISSN 0018-9472
identifier: DOI 10.1109/TSMC.1981.4308636

ELK: Eclipse Layout Kernel - Automatic layout for Java applications
type: Data
item type: computerProgram
publisher: Eclipse Foundation
rights: EPL-1.0
date: 2018-06-09T11:09:35Z
library catalog: GitHub
programming language: Java
short title: ELK

Node and Label Placement in a Layered Layout Algorithm
type: Thesis
item type: thesis
publisher: Christian-Albrechts-Universität zu Kiel
  type: Organization
  adr: Address
    locality: Kiel
authors: Person
  surname: Carstens
  givenname: John Julian
link: Carstens - Node and Label Placement in a Layered Layout Algor.pdf
date: September 2012
type: master
language: english
abstract: In graphical modelling, the arrangement of diagram elements can be a tiresome and mechanic work. To free users from this, layout algorithms arrange the diagram elements automatically. Different modelling domains require different layouts. A layout approach suitable for data flow diagrams is the layered layout approach. This approach is structured in several phases, of which one is called node placement. Present implementations are known to produce many edge bends. One task of this thesis is to employ a node placement algorithm which yields significantly less edge bends. Another well known problem in layout algorithms is label placement. Present approaches rely on a post-processing by placing labels after the diagram has been laid out. The approaches presented in this thesis integrate label placement into the layout, resulting in more freedom and clean placements of labels. Evaluation shows that both tasks can be fulfilled, but have to accept a trade-off which is a generally larger drawing of the respective diagrams.

Carstens - Node and Label Placement in a Layered Layout Algor.pdf
type: Attachment
item type: attachment
resource: Carstens - Node and Label Placement in a Layered Layout Algor.pdf
type: application/pdf