Euler diagrams have a wide variety of uses, from information visualization to logical reasoning. In all of their application areas, the ability to automatically layout Euler diagrams brings considerable benefits. In this paper, we present a novel approach to Euler diagram generation. We develop certain graphs associated with Euler diagrams in order to allow curves to be added by finding cycles in these graphs. This permits us to build Euler diagrams inductively, adding one curve at a time. Our technique is adaptable, allowing the easy specification, and enforcement, of sets of wellformednesss conditions; we present a series of results that identify properties of cycles that correspond to the wellformedness conditions. This improves upon other contributions towards the automated generation of Euler diagrams which implicitly assume some fixed set of wellformedness conditions must hold. In addition, unlike most of these other generation methods, our technique allows any abstract description to be drawn as an Euler diagram. To establish the utility of the approach, a prototype implementation has been developed
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.