Demo Data from EDBT 2026 / reviewers in the wild / expert
Josh Pollock
dblp:220/7671 · also Josh M. Pollock
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-5141-0999ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 2 since 2021
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 · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
User interface design and tools · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › visualization authoring
visualization grammar |
1.7 | 2 | 2026 | GoFish: A Grammar of More Graphics! · IEEE Trans. Vis. Comput. Graph. 2026 Animated Vega-Lite: Unifying Animation with a Grammar of Interactive Graphics · IEEE Trans. Vis. Comput. Graph. 2023 |
Visualization and visual analytics › visualization authoring › visualization grammar
grammar of graphics |
1.0 | 1 | 2026 | GoFish: A Grammar of More Graphics! · IEEE Trans. Vis. Comput. Graph. 2026 |
Visualization and visual analytics
visualization design |
1.0 | 1 | 2026 | GoFish: A Grammar of More Graphics! · IEEE Trans. Vis. Comput. Graph. 2026 |
Methods — techniques the papers use, named apart from their topics
recursive composition · 1.0gestalt principles · 1.0scene graph · 0.8compound graph · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | GoFish: A Grammar of More Graphics!abstractVisualization grammars from ggplot2 to Vega-Lite are based on the Grammar of Graphics (GoG), our most comprehensive formal theory of visualization. The GoG helped expand the expressive gamut of visualization by moving beyond fixed chart types and towards a design space of composable operators. Yet, the resultant design space has surprising limitations, inconsistencies, and cliffs - even seemingly simple charts like mosaics, waffles, and ribbons fall out of scope of most GoG implementations. To author such charts, visualization designers must either rely on overburdened grammar developers to implement purpose-built mark types (thus reintroducing the issues of typologies) or drop to lower-level frameworks. In response, we present GoFish: a declarative visualization grammar that formalizes Gestalt principles (e.g., uniform spacing, containment, and connection) that have heretofore been complected in GoG constructs. These graphical operators achieve greater expressive power than their predecessors by enabling recursive composition: they can be nested and overlapped arbitrarily. Through a diverse example gallery, we demonstrate how graphical operators free users to arrange shapes in many different ways while retaining the benefits of high-level grammars like scale resolution and coordinate transform management. Recursive composition naturally yields an infinite design space that blurs the boundary between an expressive, low-level grammar and a concise, high-level one. In doing so, we point towards an updated theory of visualization, one that is open to an innumerable space of graphic representations instead of limited to a fixed set of "good" designs. Josh Pollock, Arvind Satyanarayan |
IEEE Trans. Vis. Comput. Graph. | 1 |
| 2025 | Benthic: Perceptually Congruent Structures for Accessible Charts and DiagramsabstractASSETS ’25, Denver, CO, USA Catherine Mei, Josh Pollock, Daniel Hajas, Jonathan Zong, Arvind Satyanarayan |
ASSETS | 2 |
| 2024 | Bluefish: Composing Diagrams with Declarative RelationsabstractDiagrams are essential tools for problem-solving and communication as they externalize conceptual structures using spatial relationships. But when picking a diagramming framework, users are faced with a dilemma. They can either use a highly expressive but low-level toolkit, whose API does not match their domain-specific concepts, or select a high-level typology, which offers a recognizable vocabulary but supports a limited range of diagrams. To address this gap, we introduce Bluefish: a diagramming framework inspired by component-based user interface (UI) libraries. Bluefish lets users create diagrams using relations: declarative, composable, and extensible diagram fragments that relax the concept of a UI component. Unlike a component, a relation does not have sole ownership over its children nor does it need to fully specify their layout. To render diagrams, Bluefish extends a traditional tree-based scenegraph to a compound graph that captures both hierarchical and adjacent relationships between nodes. To evaluate our system, we construct a diverse example gallery covering many domains including mathematics, physics, computer science, and even cooking. We show that Bluefish’s relations are effective declarative primitives for diagrams. Bluefish is open source, and we aim to shape it into both a usable tool and a research platform. Josh Pollock, Catherine Mei, Grace Huang, Elliot Evans, Daniel Jackson 0001, Arvind Satyanarayan |
UIST | 1 |
| 2023 | Animated Vega-Lite: Unifying Animation with a Grammar of Interactive GraphicsabstractWe present Animated Vega-Lite, a set of extensions to Vega-Lite that model animated visualizations as time-varying data queries. In contrast to alternate approaches for specifying animated visualizations, which prize a highly expressive design space, Animated Vega-Lite prioritizes unifying animation with the language's existing abstractions for static and interactive visualizations to enable authors to smoothly move between or combine these modalities. Thus, to compose animation with static visualizations, we represent time as an encoding channel. Time encodings map a data field to animation keyframes, providing a lightweight specification for animations without interaction. To compose animation and interaction, we also represent time as an event stream; Vega-Lite selections, which provide dynamic data queries, are now driven not only by input events but by timer ticks as well. We evaluate the expressiveness of our approach through a gallery of diverse examples that demonstrate coverage over taxonomies of both interaction and animation. We also critically reflect on the conceptual affordances and limitations of our contribution by interviewing five expert developers of existing animation grammars. These reflections highlight the key motivating role of in-the-wild examples, and identify three central tradeoffs: the language design process, the types of animated transitions supported, and how the systems model keyframes. Jonathan Zong, Josh Pollock, Dylan Wootton, Arvind Satyanarayan |
IEEE Trans. Vis. Comput. Graph. | 2 |