Demo Data from VLDB 2026 / reviewers in the wild / expert
Dylan Rowe
dblp:350/5767
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2024
0009-0003-2413-0555ORCID · reported
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 · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 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 |
Rendering · 36% Geometric modeling and processing · 32% Computational fabrication · 32% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational fabrication › structural design
tensegrity structure design |
0.7 | 1 | 2023 | Sparse Stress Structures from Optimal Geometric Measures · SIGGRAPH Asia 2023 |
Geometric modeling and processing
topology optimization |
0.7 | 1 | 2023 | Sparse Stress Structures from Optimal Geometric Measures · SIGGRAPH Asia 2023 |
Mathematical optimization
continuous optimization |
0.7 | 1 | 2023 | Sparse Stress Structures from Optimal Geometric Measures · SIGGRAPH Asia 2023 |
Mathematical optimization
geometric measure theory |
0.7 | 1 | 2023 | Sparse Stress Structures from Optimal Geometric Measures · SIGGRAPH Asia 2023 |
Methods — techniques the papers use, named apart from their topics
fast fourier transform · 1.3compressive sensing · 1.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Sharpening and Sparsifying with Surface Hessians
Dylan Rowe, Alec Jacobson, Oded Stein |
SIGGRAPH Asia | 1 |
| 2023 | Sparse Stress Structures from Optimal Geometric MeasuresabstractIdentifying optimal structural designs given loads and constraints is a primary challenge in topology optimization and shape optimization. We propose a novel approach to this problem by finding a minimal tensegrity structure—a network of cables and struts in equilibrium with a given loading force. Through the application of geometric measure theory and compressive sensing techniques, we show that this seemingly difficult graph-theoretic problem can be reduced to a numerically tractable continuous optimization problem. With a light-weight iterative algorithm involving only Fast Fourier Transforms and local algebraic computations, we can generate sparse supporting structures featuring detailed branches, arches, and reinforcement structures that respect the prescribed loading forces and obstacles. Dylan Rowe, Albert Chern |
SIGGRAPH Asia | 1 |