David Bommes

David Bommes

Auto-generated profile, based on publicly available information

David Bommes

University of Bern, Bern, Switzerland

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 October 2022 in ACM Transactions on Graphics
Verified
Journal Article
Open access
NPNico Pietroni
Nico Pietroni
MCMarcel Campen
Marcel Campen
ASAlla Sheffer
Alla Sheffer
Gianmarco CherchiGianmarco Cherchi
Gianmarco Cherchi
DBDavid Bommes
David Bommes
MLMarco Livesu
Marco Livesu
In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh optimization. For each technique, we highlight capabilities and limitations, also pointing out the associated unsolved challenges. Recent relaxed approaches, aiming to generate not pure-hex but hex-dominant meshes, are also discussed. The required background, pertaining to geometrical as well as combinatorial aspects, is introduced along the way.

12 July 2019 in ACM Transactions on Graphics
Verified
Journal Article
Open access
MLMax Lyon
Max Lyon
MCMarcel Campen
Marcel Campen
DBDavid Bommes
David Bommes
LKLeif Kobbelt
Leif Kobbelt
The generation of quad meshes based on surface parametrization techniques has proven to be a versatile approach. These techniques quantize an initial seamless parametrization so as to obtain an integer grid map implying a pure quad mesh. State-of-the-art methods following this approach have to assume that the surface to be meshed either has no boundary, or has a boundary which the resulting mesh is supposed to be aligned to. In a variety of applications this is not desirable and non-boundary-aligned meshes or grid-parametrizations are preferred. We thus present a technique to robustly generate integer grid maps which are either boundary-aligned, non-boundary-aligned, or partially boundary-aligned, just as required by different applications. We thereby generalize previous work to this broader setting. This enables the reliable generation of trimmed quad meshes with partial elements along the boundary, preferable in various scenarios, from tiled texturing over design and modeling to fabrication and architecture, due to fewer constraints and hence higher overall mesh quality and other benefits in terms of aesthetics and flexibility.

1 August 2022 in Computer Graphics Forum
Verified
Journal Article
Open access
PSP. Schmidt
P. Schmidt
JBJ. Born
J. Born
DBD. Bommes
D. Bommes
MCM. Campen
M. Campen
LKL. Kobbelt
L. Kobbelt
Non‐linear optimization is essential to many areas of geometry processing research. However, when experimenting with different problem formulations or when prototyping new algorithms, a major practical obstacle is the need to figure out derivatives of objective functions, especially when second‐order derivatives are required. Deriving and manually implementing gradients and Hessians is both time‐consuming and error‐prone. Automatic differentiation techniques address this problem, but can introduce a diverse set of obstacles themselves, e.g. limiting the set of supported language features, imposing restrictions on a program's control flow, incurring a significant run time overhead, or making it hard to exploit sparsity patterns common in geometry processing. We show that for many geometric problems, in particular on meshes, the simplest form of forward‐mode automatic differentiation is not only the most flexible, but also actually the most efficient choice. We introduce TinyAD: a lightweight C++ library that automatically computes gradients and Hessians, in particular of sparse problems, by differentiating small (tiny) sub‐problems. Its simplicity enables easy integration; no restrictions on, e.g., looping and branching are imposed. TinyAD provides the basic ingredients to quickly implement first and second order Newton‐style solvers, allowing for flexible adjustment of both problem formulations and solver details. By showcasing compact implementations of methods from parametrization, deformation, and direction field design, we demonstrate how TinyAD lowers the barrier to exploring non‐linear optimization techniques. This enables not only fast prototyping of new research ideas, but also improves replicability of existing algorithms in geometry processing. TinyAD is available to the community as an open source library.

3 January 2019 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
Gianmarco CherchiGianmarco Cherchi
Gianmarco Cherchi
PAP. Alliez
P. Alliez
RSR. Scateni
R. Scateni
MLM. Lyon
M. Lyon
DBD. Bommes
D. Bommes

1 January 2014
Verified
Book Chapter
Closed access
PDF file
MKMichael Kremer
Michael Kremer
DBDavid Bommes
David Bommes
ILIsaak Lim
Isaak Lim
LKLeif Kobbelt
Leif Kobbelt

1 May 2012 in Computer Graphics Forum
Verified
Journal Article
Open access
PDF file
HZHenrik Zimmer
Henrik Zimmer
MCMarcel Campen
Marcel Campen
DBDavid Bommes
David Bommes
LKLeif Kobbelt
Leif Kobbelt
In mechanical engineering and architecture, structural elements with low material consumption and high load‐bearing capabilities are essential for light‐weight and even self‐supporting constructions. This paper deals with so called point‐folding elements – non‐planar, pyramidal panels, usually formed from thin metal sheets, which exploit the increased structural capabilities emerging from folds or creases. Given a triangulated free‐form surface, a corresponding point‐folding structure is a collection of pyramidal elements basing on the triangles. User‐specified or material‐induced geometric constraints often imply that each individual folding element has a different shape, leading to immense fabrication costs. We present a rationalization method for such structures which respects the prescribed aesthetic and production constraints and finds a minimal set of molds for the production process, leading to drastically reduced costs. For each base triangle we compute and parametrize the range of feasible folding elements that satisfy the given constraints within the allowed tolerances. Then we pose the rationalization task as a geometric intersection problem, which we solve so as to maximize the re‐use of mold dies. Major challenges arise from the high precision requirements and the non‐trivial parametrization of the search space. We evaluate our method on a number of practical examples where we achieve rationalization gains of more than 90%.