Demo Data from EDBT 2026 / reviewers in the wild / expert
Jean Flower
dblp:46/6084
· DBLP profile ↗
14ranked-venue papers
4as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-authorHuman-computer interaction and ubiquitous computing · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
2 papers |
Visualization and visual analytics · 77% Geometric modeling and processing · 23% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › set visualization
euler diagrams |
0.2 | 1 | 2014 | Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics
set visualization |
0.2 | 1 | 2014 | Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets · IEEE Trans. Vis. Comput. Graph. 2014 |
Geometric modeling and processing › solid modeling
boundary representation |
0.1 | 1 | 2019 | Generative Design Conversion to Editable and Watertight Boundary Representation · Comput. Aided Des. 2019 |
Methods — techniques the papers use, named apart from their topics
convex polygon drawing · 0.2circle drawing · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Generative Design Conversion to Editable and Watertight Boundary Representation
Martin Marinov, Marco Amagliani, Tristan Barback, Jean Flower, Stephen A. Barley, Suguru Furuta, Peter Charrot, Iain Henley, Nanda Santhanam, G. Thomas Finnigan, Siavash Meshkat, Justin Hallet, Maciej Sapun, Pawel Wolski |
Comput. Aided Des. | 4 |
| 2014 | Drawing Area-Proportional Euler Diagrams Representing Up To Three SetsabstractArea-proportional Euler diagrams representing three sets are commonly used to visualize the results of medical experiments, business data, and information from other applications where statistical results are best shown using interlinking curves. Currently, there is no tool that will reliably visualize exact area-proportional diagrams for up to three sets. Limited success, in terms of diagram accuracy, has been achieved for a small number of cases, such as Venn-2 and Venn-3 where all intersections between the sets must be represented. Euler diagrams do not have to include all intersections and so permit the visualization of cases where some intersections have a zero value. This paper describes a general, implemented, method for visualizing all 40 Euler-3 diagrams in an area-proportional manner. We provide techniques for generating the curves with circles and convex polygons, analyze the drawability of data with these shapes, and give a mechanism for deciding whether such data can be drawn with circles. For the cases where nonconvex curves are necessary, our method draws an appropriate diagram using nonconvex polygons. Thus, we are now always able to automatically visualize data for up to three sets. Peter Rodgers 0001, Gem Stapleton, Jean Flower, John Howse |
IEEE Trans. Vis. Comput. Graph. | 3 |
| 2012 | Speedith: A Diagrammatic Reasoner for Spider Diagrams
Matej Urbas, Mateja Jamnik, Gem Stapleton, Jean Flower |
Diagrams | 4 |
| 2010 | Drawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Peter Rodgers 0001, Jean Flower, Gem Stapleton, John Howse |
Diagrams | 2 |
| 2009 | Some Results for Drawing Area Proportional Venn3 With Convex CurvesabstractMany data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diagrams with three intersecting curves are considered useful for visualizing data in many applications, including bioscience, ecology and medicine. To ease the understanding of such diagrams,using restricted dasianicepsila shapes for the curves is considered beneficial. Many research questions on the use of such diagrams are still open. For instance, a general solution to the question of when given area specifications can be represented by Venn3 using convex curves is still unknown.In this paper we study symmetric Venn3 drawn with convex curves and show that there is a symmetric area specification that cannot be represented with such a diagram. In addition, by using symmetric diagrams drawn with polygons, we show that, if area specifications are restricted so that the double intersection areas are no greater than the triple intersection area then the specification can be drawn with convex curves. We also propose a construction that allows the representation of some area specifications when the double intersection areas are greater than the triple intersection area.Finally, we present some open questions on the topic. Peter Rodgers 0001, Jean Flower, Gem Stapleton, John Howse |
IV | 2 |
| 2008 | Euler Diagram Decomposition
Andrew Fish, Jean Flower |
Diagrams | 2 |
| 2007 | Automated Theorem Proving in Euler Diagram Systems
Gem Stapleton, Judith Masthoff, Jean Flower, Andrew Fish, Jane Southern |
J. Autom. Reason. | 3 |
| 2004 | Generating Readable Proofs: A Heuristic Approach to Theorem Proving With Spider Diagrams
Jean Flower, Judith Masthoff, Gem Stapleton |
Diagrams | 1 |
| 2004 | Drawing Graphs in Euler Diagrams
Paul Mutton, Peter Rodgers 0001, Jean Flower |
Diagrams | 3 |
| 2004 | Dynamic Euler Diagram DrawingabstractIn this paper we describe a method to lay out a graph enhanced Euler diagram so that it looks similar to a previously drawn graph enhanced Euler diagram. This task is nontrivial when the underlying structures of the diagrams differ. In particular, if a structural change is made to an existing drawn diagram, our work enables the presentation of the new diagram with minor disruption to the user's mental map. As the new diagram can be generated from an abstract representation, its initial embedding may be very different from that of the original. We have developed comparison measures for Euler diagrams, integrated into a multicriteria optimizer, and applied a force model for associated graphs that attempts to move nodes towards their positions in the original layout. To further enhance the usability of the system, the transition between diagrams can be animated Peter Rodgers 0001, Paul Mutton, Jean Flower |
VL/HCC | 3 |
| 2004 | Nesting in Euler Diagrams: syntax, semantics and construction
Jean Flower, John Howse, John Taylor 0001 |
Softw. Syst. Model. | 1 |
| 2003 | Layout Metrics for Euler DiagramsabstractWe present an aesthetics based method for drawing Euler diagrams. Aesthetic layout metrics have been found to be useful in graph drawing algorithms, which use metrics motivated by aesthetic principles that aid user understanding of diagrams. We have taken a similar approach to Euler diagram drawing, and have defined a set of suitable metrics to be used within a hill climbing multicriteria optimiser to produce "good" drawings. There are added difficulties when drawing Euler diagrams as they are made up of contours whose structural properties of intersection and containment must be preserved under any layout improvements. We describe our Java implementation of a pair of hill climbing variants to find good drawings, a set of metrics that measure aesthetics for good diagram layout, and issues concerning the choice of weightings for a useful combination of the metrics. Jean Flower, Peter Rodgers 0001, Paul Mutton |
IV | 1 |
| 2002 | Generating Euler Diagrams
Jean Flower, John Howse |
Diagrams | 1 |
| 2002 | Corresponding Regions in Euler Diagrams
John Howse, Gem Stapleton, Jean Flower, John Taylor 0001 |
Diagrams | 3 |