Skip to main content
SpringerLink
Log in

Hypergraphs as a Uniform Diagram Representation Model

  • Conference paper
Theory and Application of Graph Transformations (TAGT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1764))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agusti, J., Puigsegur, J., Robertson, D.: A visual syntax for logic and logic programming. Journal of Visual Languages and Computing 9, 399–427 (1998)

    Article  Google Scholar 

  2. Andries, M., Engels, G., Rekers, J.: How to represent a visual program? In: Proc. 1996 Workshop on Theory of Visual Languages, Gubbio, Italy (May 1996)

    Google Scholar 

  3. Bardohl, R., Taentzer, G.: Defining visual languages by algebraic specification techniques and graph grammars. In: Proc. 1997 Workshop on Theory of Visual Languages, Capri, Italy (September 1997)

    Google Scholar 

  4. Blostein, D., Grbavec, A.: Recognition of mathematical notation. In: Bunke, H., Wang, P. (eds.) Handbook of Character Recognition and Document Image Analysis, ch. 21, pp. 557–582. World Scientific, Singapore (1997)

    Google Scholar 

  5. Bottoni, P., Costabile, M., Levialdi, S., Mussio, P.: Formalising visual languages. In: [24], pp. 45–52 (1995)

    Google Scholar 

  6. Costagliola, G., Lucia, A.D., Orefice, S., Tortora, G.: A framework of syntactic models for the implementation of visual languages. In: [26], pp. 58–65 (1997)

    Google Scholar 

  7. Ehrig, H.: Introduction to the algebraic theory of graph grammars. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 1–69. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

  8. Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  9. Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3,4) (1996)

    Google Scholar 

  10. ITU-T, Geneva. Recommendation Z.120: Message Sequence Chart (MSC)

    Google Scholar 

  11. Lutz, R.: Chart parsing of flowgraphs. In: Proc. 11th Int. Conf. on Artificial Intelligence (IJCAI 1989), Detroit, Michigan, pp. 116–121 (August 1989)

    Google Scholar 

  12. Marriott, K.: Constraint multiset grammars. In: [23], pp. 118–125 (1994)

    Google Scholar 

  13. Mehlhorn, K.: Data Structures and Algorithms 3 – Multi-dimensional Searching and Computational Geometry. Springer, Heidelberg (1984)

    MATH  Google Scholar 

  14. Minas, M.: Diagram editing with hypergraph parser support. In: [26], pp. 230–237 (1997)

    Google Scholar 

  15. Minas, M., Shklar, L.: A high-level visual language for generating web structures. In: [25], p. 248 (1996)

    Google Scholar 

  16. Minas, M., Viehstaedt, G.: DiaGen: A generator for diagram editors providing direct manipulation and execution of diagrams. In: [24], pp. 203–210 (1995)

    Google Scholar 

  17. Nassi, I., Shneiderman, B.: Flowchart techniques for structured programming. SIGPLAN Notices 8(8), 12–26 (1973)

    Article  Google Scholar 

  18. Puigsegur, J., Schorlemmer, W.M., Agusti, J.: From queries to answers in visual logic programming. In: [26], pp. 102–109 (1997)

    Google Scholar 

  19. Rekers, J., Schürr, A.: A graph grammar approach to graphical parsing. In: [24], pp. 195–202 (1995)

    Google Scholar 

  20. Rekers, J., Schürr, A.: A graph based framework for the implementation of visual environments. In: [25], pp. 148–155 (1996)

    Google Scholar 

  21. Viehstaedt, G., Minas, M.: Interaction in really graphical user interfaces. In: [23], pp. 270–277 (1994)

    Google Scholar 

  22. Zhang, D.-Q., Zhang, K.: Reserved graph grammar: A specification tool for diagrammatic VPLs. In: [26], pp. 288–295 (1997)

    Google Scholar 

  23. 1994 IEEE Symp. on Visual Languages, St. Louis, Missouri (October 1994)

    Google Scholar 

  24. 1995 IEEE Symp. on Visual Languages, Darmstadt, Germany (September 1995)

    Google Scholar 

  25. 1996 IEEE Symp. on Visual Languages, Boulder, Colorado (September 1996)

    Google Scholar 

  26. 1997 IEEE Symp. on Visual Languages, Capri, Italy (September 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Programmiersprachen, Universität Erlangen-Nürnberg, Martensstr. 3, 91058, Erlangen, Germany

    Mark Minas

Authors
  1. Mark Minas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Warburger Straße 100, 33098, Paderborn, Germany

    Gregor Engels

  3. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minas, M. (2000). Hypergraphs as a Uniform Diagram Representation Model. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46464-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67203-6

  • Online ISBN: 978-3-540-46464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation