Constraint diagrams: visualizing invariants in object-oriented models
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Polygon comparison using a graph representation
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Automated Theorem Proving in Euler Diagram Systems
Journal of Automated Reasoning
Generating and drawing area-proportional euler and venn diagrams
Generating and drawing area-proportional euler and venn diagrams
ICCS '08 Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Journal of Visual Languages and Computing
Interactive visual classification with Euler diagrams
VLHCC '09 Proceedings of the 2009 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)
Abstractions of Euler Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Euler Diagrams in Traditional Library Environments
Electronic Notes in Theoretical Computer Science (ENTCS)
The semantics of augmented constraint diagrams
Journal of Visual Languages and Computing
Efficient on-line algorithms for Euler diagram region computation
Computational Geometry: Theory and Applications
Symmetric monotone Venn diagrams with seven curves
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
IEEE Transactions on Visualization and Computer Graphics
Euler diagram codes: interpretation and generation
Proceedings of the 6th International Symposium on Visual Information Communication and Interaction
Hi-index | 0.00 |
Euler Diagrams are a well-known visualisation of set-based relationships, used in many application areas and at the basis of more complex notations. We propose a static code for concrete Euler Diagrams, which enables efficient storage (vs. storage of concrete diagrams), and transformations preserving concrete-level structure, hence the viewer's mental map. We provide the theoretical underpinnings of the encoding, examples and deductions, and an indication of their utility. For use in an interactive setting, we provide algorithms to update the code upon curve addition and removal. Independently, we show that the code identifies minimal regions, enabling the computation of the abstract zone set.