EDBT 2026 Demo / reviewers in the wild / expert
Andrew O. Sageman-Furnas
dblp:150/1249
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0001-5344-3727ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 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 |
Geometric modeling and processing · 84% Computational fabrication · 16% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
parameterization |
0.4 | 1 | 2019 | Chebyshev nets from commuting PolyVector fields · ACM Trans. Graph. 2019 |
Geometric modeling and processing
shape optimization |
0.1 | 1 | 2014 | Wire mesh design · ACM Trans. Graph. 2014 |
Methods — techniques the papers use, named apart from their topics
optimization · 0.4constrained optimization · 0.2chebyshev net · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Chebyshev nets from commuting PolyVector fieldsabstractWe propose a method for computing global Chebyshev nets on triangular meshes. We formulate the corresponding global parameterization problem in terms of commuting PolyVector fields, and design an efficient optimization method to solve it. We compute, for the first time, Chebyshev nets with automatically-placed singularities, and demonstrate the realizability of our approach using real material. Andrew O. Sageman-Furnas, Albert Chern, Mirela Ben-Chen, Amir Vaxman |
ACM Trans. Graph. | 1 |
| 2016 | A 2× Lax Representation, Associated Family, and Bäcklund Transformation for Circular K-Nets
Tim Hoffmann, Andrew O. Sageman-Furnas |
Discret. Comput. Geom. | 2 |
| 2014 | Wire mesh designabstractWe present a computational approach for designing wire meshes , i.e., freeform surfaces composed of woven wires arranged in a regular grid. To facilitate shape exploration, we map material properties of wire meshes to the geometric model of Chebyshev nets . This abstraction is exploited to build an efficient optimization scheme. While the theory of Chebyshev nets suggests a highly constrained design space, we show that allowing controlled deviations from the underlying surface provides a rich shape space for design exploration. Our algorithm balances globally coupled material constraints with aesthetic and geometric design objectives that can be specified by the user in an interactive design session. In addition to sculptural art, wire meshes represent an innovative medium for industrial applications including composite materials and architectural façades. We demonstrate the effectiveness of our approach using a variety of digital and physical prototypes with a level of shape complexity unobtainable using previous methods. Akash Garg, Andrew O. Sageman-Furnas, Bailin Deng, Yonghao Yue, Eitan Grinspun, Mark Pauly, Max Wardetzky |
ACM Trans. Graph. | 2 |