Welcome to the Computer Graphics Group at University of Bern!

New SIGGRAPH papers

The three papers Expansion Cones: A Progressive Volumetric Mapping Framework, Locally Meshable Frame Fields and Min-Deviation-Flow in Bi-directed Graphs for T-Mesh Quantization were accepted for publication and are to be presented in SIGGRAPH 2023 Conference

May 12, 2023

Best paper award SGP 2022

The paper TinyAD: Automatic Differentiation in Geometry Processing Made Simple, co-authored by Prof. David Bommes, won the Best Paper Award 1st place at the Symposium on Geometry Processing 2022. SGP2022/awards

July 7, 2022

Invited talk by visiting researcher Hendrik Brückler, Osnabrück University, Germany

Title: "How to build hex meshes using motorcycles (not the other way around)” Monday, June 13th, 2022, Time: 11:00 Location: N10, room 104

June 13, 2022

Invited talk by visiting researcher Tim Felle Olsen, TU Denmark

Title: Synthesis of Frame Field-aligned Multi-Laminar Structures Thursday, October 28th, 2021, Time: 16:30 Location: N10, room 302

Oct. 28, 2021

Best paper award SGP 2021

The paper Geodesic Distance Computation via Virtual Source Propagation, coauthored by Prof. David Bommes, won the Best Paper 2nd Place at the Symposium on Geometry Processing 2021. SGP2021/awards

Sept. 10, 2021

Invited Talks from Hextreme team UCL, Belgium

Pierre-Alexandre Beaufort and Maxence Reberol (both from the hextreme team at UC Louvain) will be visiting us. There will be two talks on Wednesday 4th, 11:00 and 14:00 respectively, see Talks section to learn more.

March 4, 2020

Recent Publications

Quad Mesh Quantization Without a T-Mesh

Computer Graphics Forum

Grid preserving maps of triangulated surfaces were introduced for quad meshing because the 2D unit grid in such maps corresponds to a sub-division of the surface into quad-shaped charts. These maps can be obtained by solving a mixed integer optimization problem: Real variables define the geometry of the charts and integer variables define the combinatorial structure of the decomposition. To make this optimization problem tractable, a common strategy is to ignore integer constraints at first, then to enforce them in a so-called quantization step. Actual quantization algorithms exploit the geometric interpretation of integer variables to solve an equivalent problem: They consider that the final quad mesh is a sub-division of a T-mesh embedded in the surface, and optimize the number of sub-divisions for each edge of this T-mesh. We propose to operate on a decimated version of the original surface instead of the T-mesh. It is easier to implement and to adapt to constraints such as free boundaries, complex feature curves network etc.