Formal issues in languages based on closed curves

FISH, ANDREW and STAPLETON, GEM (2006) Formal issues in languages based on closed curves In: Proceedings of the 2006 International Workshop on Visual Languages and Computing, Grand Canyon, USA, August 30-September 1, 2006.

[img]
Preview
Text
VLc06-Fish.pdf - Submitted Version

Download (105kB) | Preview

Abstract

Three important questions arise when using visual languages: for any given piece of information can we draw a diagram representing that information, can we reliably interpret the diagrams and can we reason diagrammatically about that information? The desirable answer to all three questions is yes, but these desires are often conflicting; for example, well-formedness conditions can be enforced to assist diagram interpretation but this can result in drawability problems. In this paper, we focus on visual languages based on closed curves, which are used in numerous computing applications. Many such languages effectively use spatial properties such as containment and disjointness. We consider the consequences of enforcing various well-formedness conditions, such as simplicity and connectedness of minimal regions, in relation to the above questions. We suggest refinements of the conditions in order to find a balance between the conflicting desires.

Item Type: Contribution to conference proceedings in the public domain ( Full Paper)
Additional Information: © 2006 The Author(s)
Uncontrolled Keywords: Visual languages; Closed curves
Subjects: G000 Computing and Mathematical Sciences
Faculties: Faculty of Science and Engineering > School of Computing, Engineering and Mathematics > Visual Modelling
Depositing User: Converis
Date Deposited: 24 Nov 2007
Last Modified: 21 May 2014 11:01
URI: http://eprints.brighton.ac.uk/id/eprint/3268

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year