EDBT 2026 Demo / reviewers in the wild / expert
Dave Pagurek van Mossel
dblp:252/4433
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 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
1 paper |
Geometric modeling and processing · 87% Visual content generation and editing · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
curve fitting |
0.5 | 1 | 2021 | StrokeStrip: joint parameterization and fitting of stroke clusters · ACM Trans. Graph. 2021 |
Geometric modeling and processing
parameterization |
0.5 | 1 | 2021 | StrokeStrip: joint parameterization and fitting of stroke clusters · ACM Trans. Graph. 2021 |
Methods — techniques the papers use, named apart from their topics
variational optimization · 0.5discrete-continuous optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | StrokeStrip: joint parameterization and fitting of stroke clustersabstractWhen creating freeform drawings, artists routinely employ clusters of overdrawn strokes to convey intended, aggregate curves. The ability to algorithmically fit these intended curves to their corresponding clusters is central to many applications that use artist drawings as inputs. However, while human observers effortlessly envision the intended curves given stroke clusters as input, existing fitting algorithms lack robustness and frequently fail when presented with input stroke clusters with non-trivial geometry or topology. We present StrokeStrip , a new and robust method for fitting intended curves to vector-format stroke clusters. Our method generates fitting outputs consistent with viewer expectations across a vast range of input stroke cluster configurations. We observe that viewers perceive stroke clusters as continuous, varying-width strips whose paths are described by the intended curves. An arc length parameterization of these strips defines a natural mapping from a strip to its path. We recast the curve fitting problem as one of parameterizing the cluster strokes using a joint 1D parameterization that is the restriction of the natural arc length parameterization of this strip to the strokes in the cluster. We simultaneously compute the joint cluster parameterization and implicitly reconstruct the a priori unknown strip geometry by solving a variational problem using a discrete-continuous optimization framework. We use this parameterization to compute parametric aggregate curves whose shape reflects the geometric properties of the cluster strokes at the corresponding isovalues. We demonstrate StrokeStrip outputs to be significantly better aligned with observer preferences compared to those of prior art; in a perceptual study, viewers preferred our fitting outputs by a factor of 12:1 compared to alternatives. We further validate our algorithmic choices via a range of ablation studies; extend our framework to raster data; and illustrate applications that benefit from the parameterizations produced. Dave Pagurek van Mossel, Chenxi Liu 0004, Nicholas Vining, Mikhail Bessmeltsev, Alla Sheffer |
ACM Trans. Graph. | 1 |
| 2019 | Controlling Procedural Modelling Interactively with Guiding Curves
Dave Pagurek van Mossel, Abhishek Madan, Tai Meng Lui, Paul Bardea, Andrew McBurney |
Graphics Interface | 1 |