Towards a General Solution to Drawing Area-Proportional Euler Diagrams

Authors:
Stirling Chow;Frank Ruskey
Affiliations:
Department of Computer Science, University of Victoria, Victoria, B.C., Canada;Department of Computer Science, University of Victoria, Victoria, B.C., Canada
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 1
Cited 5

Layout Metrics for Euler Diagrams

IV '03 Proceedings of the Seventh International Conference on Information Visualization

Diagrammatic Reasoning Systems

ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
A graph theoretic approach to general Euler diagram drawing

Theoretical Computer Science
Using Euler Diagrams in Traditional Library Environments

Electronic Notes in Theoretical Computer Science (ENTCS)
Drawing area-proportional Venn-3 diagrams with convex polygons

Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
A general method for drawing area-proportional Euler diagrams

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a deterministic algorithm for drawing Euler diagrams using n simple polygons so that the regions have a prescribed area. Our solution works for all Euler diagrams that have a region of common intersection (i.e., region {1,2,...,n}), and for any weight function. When there is no region for {1,2,...,n}, the algorithm can still be applied, but will sometimes create an Euler diagram where the curves are self-intersecting.