Efficient on-line algorithms for Euler diagram region computation

DOI10.1016/j.comgeo.2010.07.003zbMath1200.65015OpenAlexW1988586606MaRDI QIDQ709068

Gennaro Cordasco, Rosario De Chiara, Andrew Fish

Publication date: 15 October 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.07.003

zbMATH Keywords

on-line algorithmsgraphical examplesEuler diagramsdiagram generationregion computationremovals of curvesvisualisation of data

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Uses Software

• VennMaster

Cites Work

• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Which \(n\)-Venn diagrams can be drawn with convex \(k\)-gons?
• Automated theorem proving in Euler diagram systems
• Euler’s visual logic
• A Decidable Constraint Diagram Reasoning System
• Sorting jordan sequences in linear time using level-linked search trees
• Automated Reasoning
• Spider Diagrams
• Diagrammatic Representation and Inference
• Diagrammatic Representation and Inference
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient on-line algorithms for Euler diagram region computation