Hypergraphs as a uniform diagram representation model

Minas M (2000)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 2000

Publisher: Springer

Series: Lecture Notes in Computer Science

City/Town: Berlin Heidelberg

Book Volume: 1764

Pages Range: 281-295

Conference Proceedings Title: Theory and Application of Graph Transformations - 6th International Workshop (TAGT’98)

Event location: Paderborn DE

ISBN: 3-540-67203-6

URI: http://www2.informatik.uni-erlangen.de/publication/download/tagt98.pdf

DOI: 10.1007/978-3-540-46464-8_20

Abstract

When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concepts for such internal models. This paper shows how hypergraphs can be uniformly used for a wide range of different diagram types where hyperedges are used to represent diagram components as well as spatial relationships between components. This paper also proposes a procedure for translating diagrams into their hypergraph model, i.e., a graphical scanner, and a procedure to check the hypergraph against a hypergraph grammar defining the diagrams’ syntax, i.e., a parsing procedure. Such procedures are necessary to make use of such a hypergraph model in visual environments that support free-hand editing where the user can modify diagrams arbitrarily.

How to cite

APA:

Minas, M. (2000). Hypergraphs as a uniform diagram representation model. In Ehrig, Hartmut ; Engels, Gregor ; Kreowski, Hans-Jörg ; Rozenberg, Grzegorz (Eds.), Theory and Application of Graph Transformations - 6th International Workshop (TAGT’98) (pp. 281-295). Paderborn, DE: Berlin Heidelberg: Springer.

MLA:

Minas, Mark. "Hypergraphs as a uniform diagram representation model." Proceedings of the 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), Paderborn Ed. Ehrig, Hartmut ; Engels, Gregor ; Kreowski, Hans-Jörg ; Rozenberg, Grzegorz, Berlin Heidelberg: Springer, 2000. 281-295.

BibTeX: Download