The following pages link to (Q4737278):
Displayed 12 items.
- Efficient on-line algorithms for Euler diagram region computation (Q709068) (← links)
- A graph theoretic approach to general Euler diagram drawing (Q1041227) (← links)
- Neural ideals and stimulus space visualization (Q1693345) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Automated theorem proving in Euler diagram systems (Q2467560) (← links)
- Drawing interactive Euler diagrams from region connection calculus specifications (Q2629218) (← links)
- Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search (Q2938524) (← links)
- On the Completeness of Spider Diagrams Augmented with Constants (Q2948608) (← links)
- Subdivision Drawings of Hypergraphs (Q3611876) (← links)
- Visual Mathematics: Diagrammatic Formalization and Proof (Q5505526) (← links)
- Generating Effective Euler Diagrams (Q5878860) (← links)
- Can We “Show” the Correctness of Reasoning? On the Role of Diagrammatic Spatialization in Logical Justification (Q6110238) (← links)