Add SGP events to your calendar

We recommend subscribing to our calendar using the WebCal URL below instead of downloading the .ics, so your calendar can automatically update when the program is changed. (Note: Depending on your calendar this may actually not work very well, so adding it to your calendar just before the conference is the safest bet).

  • MacOS Calendar.app: File | New Calendar Subscription
  • Outlook Web: Add Calendar | Subscribe from web
  • Google Calendar (web): Click link below, or: Other Calendars + | Import. Note: Do not use the WebCAL link with Google calendar due to bugs (you will get an outdated version)

Graduate School Schedule

Graduate School Schedule

Monday
June 29

Tuesday
June 30

08:30

09:00

10:30

11:00

12:30

14:00

15:30

16:00

17:30

Registration
Shape Spaces
Josua Sassen, Florine Hartwig
Coffee break
Computational Geometric Fluid Mechanics
Sina Nabizadeh, Hesper Yin
Lunch
Cone-Nets: Theory and Interactive Design
Klara Mundilova, Michele Vidulis
Coffee break
Geometry Processing from 2D Image Priors
Dale Decatur, Richard Liu, Nam Anh Dinh
Registration
Directional Fields
Amir Vaxman
Coffee break
Differentiable Geometry Processing in Python
Ana Dodik, Ahmed Mahmoud
Lunch
Closest Point Geometry Processing
Nathan King
Coffee break
Spatial acceleration structures: Bounding Volume Hierarchies
Markus Billeter
Conference Schedule

Conference Schedule (Download .ics)

Wednesday
July 1

Thursday
July 2

Friday
July 3

08:30

09:15

09:30

10:30

11:00

12:30

14:00

14:45

15:30

16:00

17:00

17:20

18:00

19:00

23:00

Welcome Coffee & Registration
Opening Session
Keynote:
Geometric not-so-deep learning
Julie Digne
Coffee break
Session:
Geometric Solvers
Lunch
Session:
Deformation and Registration
Coffee break
Industry Session
Poster fast forward
Poster Apéro – Wine & Cheese (Foyer)
Welcome Coffee & Registration
Keynote:
Computational Optimal Transport
Justin Solomon
Coffee break
Session:
Meshing and Vector Field Processing
Group Photo
Lunch
Session:
Distance Fields
Coffee break
Session: Hulls
City Tour
Conference Dinner
Welcome Coffee & Registration
Keynote:
Resource-Efficient Visual Computing
Bernhard Kerbl
Coffee break
Session:
Fabrication and Verification
Lunch
Session: Datasets and Analysis
Town Hall Meeting
Awards & Closing

Keynotes (YouTube playlist)

Portrait of Julie Digne

Julie Digne
LIRIS - CNRS - Université Claude Bernard Lyon 1

Wednesday, July 1, 09:30

Geometric not-so-deep learning (Video)

Over the past decade, deep learning for geometric data processing has advanced significantly, with numerous methods proposed to handle irregular, non-Euclidean data. However, 3D objects databases are scarce and only partially cover the variety of shapes practitioners want to analyze. As a consequence many shapes fall out-of-distribution. However, many tasks, such as compression, denoising or resampling, can already benefit from leveraging statistical geometric features, without requiring shape space priors. In this talk, I will focus on lightweight methods that are computationally efficient, run on standard hardware by operating directly on individual shapes. Through a series of projects, I will show how modern optimization techniques, with or without neural networks, can address geometric challenges effectively, without relying on large datasets or heavy computational resources.

Julie Digne is a Senior Researcher at CNRS, affiliated with the LIRIS laboratory in Lyon (Origami team). She earned her PhD in Applied Mathematics from École normale supérieure de Cachan in 2010. Following a postdoctoral position at INRIA, she joined LIRIS in 2012, where her research focuses on geometry processing and machine learning for geometric data.

Portrait of Justin Solomon

Justin Solomon
MIT CSAIL

Thursday, July 2, 09:30

Computational Optimal Transport: From Low to High Dimension and Back (Video)

The optimal transport problem asks a simple geometric question: What is the most efficient way to transform one probability distribution into another along a piece of geometry? Beyond its mathematical interest, optimal transport underlies a variety of applications, from supply chains to mesh processing, statistics, and even generative AI. Over the past two decades, research in geometry processing has played a central role in shaping algorithms for optimal transport, with foundational advances emerging from the SGP community. At the same time, popular problems in applied optimal transport have shifted from low-dimensional settings in graphics and imaging to high-dimensional settings in machine learning.

In this retrospective keynote, I will trace how my team’s work in computational optimal transport was shaped by studying its applications to geometry processing—even as the landscape of research in this area shifted in dimensionality and application. Ultimately, this journey illustrates the broader value of “Geometric Data Processing” as a discipline: identifying shared geometric and variational principles across domains that differ dramatically in dimension, scale, and data fidelity.

Justin Solomon is an associate professor of Electrical Engineering and Computer Science in MIT’s Computer Science and Artificial Intelligence Laboratory (CSAIL). He leads the CSAIL Geometric Data Processing group, which studies problems at the intersection of geometry, large-scale optimization, and applications.

Portrait of Bernhard Kerbl

Bernhard Kerbl
University of Copenhagen / Vienna University of Technology (TU Wien)

Friday, July 3, 09:30

Resource-Efficient Visual Computing – Frontiers and Applications of Real-Time Visual AI

Modern visual computing is transforming the means and ways by which we map, understand and interact with the physical world. 3D and 4D reconstructions of real artefacts are now viable from just a handful of casual camera observations; object recognition and classification can be done with unprecedented accuracy and reliability. However, a key requirement for the overall usefulness of these methods is their efficiency: Efficiency dictates whether a solution can run in real-time; it governs the hardware requirements for execution, and wether it can be used without requiring massive, industry-grade infrastructure. Real-time performance enables crucial emerging trends, such as robots interacting with the real world, or visual AI providing on-line assistance in medical treatments on patients. Resource-efficiency, on the other hand, ensures that these breakthrough technologies can be employed by almost anyone. In this talk, Dr. Kerbl will discuss key challenges and opportunities of real-time, resource-efficient visual computing and AI, focusing on open tasks in fundamental research and applied fields, including biomedicine and robotics.

Dr. Kerbl is a Tenure-track Assistant Professor at the University of Copenhagen and a Principal Project Investigator associated with the Vienna University of Technology (TU Wien). Before that, he was a Visiting Researcher at the Robotics Institute, Carnegie Mellon University, in the Human Sensing Lab under Fernando de La Torre. He obtained his PhD at Graz University of Technology in 2018. In 2019 he pursued a postdoc at TU Wien in 2019, followed by another in 2022 with INRIA in George Drettakis’ GraphDeco group. His research focuses on real-time graphics, parallel processing, point-based rendering, image-based rendering, radiance fields and novel-view synthesis. Through collaboration with mentors, colleagues and students, Dr. Kerbl’s research has been honored with Best Paper awards at major graphics conferences, including SIGGRAPH, High-Performance Graphics, Pacific Graphics, EGPGV, and GRAPP. He has lectured on the topics of GPU programming, real-time rendering, physically-based rendering, game physics and scientific working at TU Wien, Graz University of Technology and FH Salzburg.

Graduate School (YouTube playlist)

Shape Spaces (Video)

Monday, June 29, 09:00

In applications such as animation or shape analysis, we are interested in processing multiple shapes at once and, hence, in a mathematical model for collections of shapes yielding flexible numerical tools. [1] proposed to consider Riemannian shape spaces in this context, i.e. possibly infinite-dimensional Riemannian manifolds where points are geometric objects such as surfaces. These (Riemannian) shape spaces have found usage in a lot of areas of applied mathematical research such as computational anatomy, computer graphics, shape optimization, and image processing. In this course, we will give an overview of different types of shape spaces interesting for geometry processing and will discuss concrete algorithms resulting from their theory.

[1] Kendall, David G. “Shape manifolds, procrustean metrics, and complex projective spaces.” Bulletin of the London mathematical society 16.2 (1984): 81-121.

Computational Geometric Fluid Mechanics (Video)

Monday, June 29, 11:00

Modern fluid simulation increasingly relies on geometric formulations. Prominent examples include Lie-advection-based methods that preserve energy and geometric invariants more faithfully than approaches that directly approximate the governing PDEs, showcasing geometric fluid mechanics as an impactful framework for fluid simulation. This course develops geometric fluid mechanics from first principles. We first introduce the geometric formulation following Arnold’s interpretation of the Euler equations, in which fluid motion is described as geodesic flow on the infinite-dimensional Riemannian manifold of volume-preserving diffeomorphisms. We present the necessary background, ranging from Lie groups and variational principles to Lagrangian and Hamiltonian mechanics, and elucidate the invariant structures that arise from this geometric perspective. We then discuss how smooth geometric structures can be translated into discrete settings, where fluid motion becomes a constrained geodesic flow on a sub-Riemannian manifold induced by discretization. Finally, we will analyze modern methods grounded in these principles from computer graphics and computational fluid mechanics.

Cone-Nets: Theory and Interactive Design (Video)

Monday, June 29, 14:00

Sheet-material structures provide practical and aesthetic advantages and play an important role across architecture, design, and engineering. Consequently, the development of geometric methods and computational tools for their design remains an active research direction.

This lecture focuses on cone-nets as a class of surface parameterizations and on their semi-discrete and discrete counterparts, which form special classes of structures composed of developable strips and regular planar quad meshes, respectively. We discuss the theoretical framework underlying these structures and present a novel construction method implemented as interactive design tools for Grasshopper / Rhinoceros 3D, the CNets and C-tubes plugins. These tools enable real-time exploration of the design space with intuitive controls and support form-finding optimization to meet user-specified objectives.

By the end of the lecture, attendees will understand the theoretical foundations of cone-nets and be equipped to explore their design space using the presented tools.

Geometry Processing from 2D Image Priors (Video)

Monday, June 29, 16:00

2D foundation models have exploded in popularity in recent years. While text-to-image generative models, image feature encoders, and VLMs (vision-language models) are widely used in 2D contexts such as image processing, they also facilitate numerous applications to traditionally 3D domains such as robotics, self-driving, and 3D generation. This course explores how 3D understanding can emerge from 2D priors, and how we can leverage these priors towards tasks in geometry processing. We summarize the literature on lifting 2D supervision to 3D tasks, covering both optimization and back projection methods. In doing so, we address common challenges in this field and discuss several applications: stylization, localization, and deformation.

Directional Fields (Video)

Tuesday, June 30, 09:00

I will discuss classic and state-of-the-art methods to design directional fields on discrete surfaces, with applications to meshing, solving PDEs, and visualization.

Differentiable Geometry Processing in Python (Video)

Tuesday, June 30, 11:00

Inverse problems have a long history in computer graphics with applications ranging from fabrication to computer vision. While existing software packages such as Taichi, Mitsuba, Warp, and PyTorch3D focus primarily on differentiating through simulations of physical systems such as elasticity or light transport, differentiating through geometry processing algorithms is relatively underexplored. Existing geometry-processing-focused libraries for gradient computation (e.g., TinyAD) have poor operability with machine learning frameworks and no GPU support, limiting their practicality. This course explores how PyTorch, with its automatic differentiation and GPU acceleration capabilities, can be leveraged for differentiable geometry processing. We begin with the fundamentals of PyTorch, covering its computational model and automatic differentiation mechanisms, before introducing key optimization techniques for geometric data, focusing on meshes and other common representations. The course will include real-world applications of these concepts such as mesh smoothing and parameterization, meta-optimization, as well as machine-learning workflows. By the end of the session, attendees will have a practical understanding of how to integrate PyTorch into their own differentiable geometry processing workflows.

Closest Point Geometry Processing (Video)

Tuesday, June 30, 14:00

Objects can be represented in various forms, including meshes, point clouds, level sets, and neural implicits. Traditionally, many algorithms are limited to a single specific representation. This course focuses on geometry processing techniques designed for any representation supporting closest-point queries.

By requiring only closest points, these methods become universally applicable across the above representations and more. Furthermore, objects can be manifold or nonmanifold, open or closed, orientable or not, and of any codimension or even mixed codimension. We provide an introduction to the closest point method (CPM) for solving PDEs and discuss extensions for applications commonly encountered in geometry processing.

Spatial acceleration structures: Bounding Volume Hierarchies (Video)

Tuesday, June 30, 16:00

Spatial acceleration structures play an important role in many high-performance graphics applications. They enable logarithmic time spatial queries (intersections, in-range, …), which is crucial for performance with ever larger data sets. A prominent example is ray tracing, where they are used to find intersections between view rays and geometry. However, to get the benefits from a spatial data structure, one must first obtain such, an O(N log(N)) process.

This course provides a practical introduction to spatial acceleration structures. It first introduces different types of spatial data structures, but then specifically focuses on bounding volume hierarchies (BVHs), which are a very common choice. It covers their use -performing spatial queries- and their construction. We will discuss different challenges, including dynamic data. We will then focus on the practical implementation, including considerations for GPUs. At the end of the course, we will have covered the full pipeline: from construction of a BVH to performing spatial queries.

Technical Papers

Proceedings in EG Digital Library

Note to authors
If you spot any errors in the data of your paper, or would like to add a project/code URL, please open a pull request for program.md in our website repo.
Note that not all EG Digital Library URLs and DOI links are functional yet, this is expected.

Geometric Solvers (Playlist)
chaired by Mark Gillespie

Wednesday, July 1, 11:00
  • Single Line Drawing Generation via Semantics-Driven Optimization
    T. Magne, A. Binninger, R. Wiersma, O. Sorkine-Hornung
  • Differentiable Randers-Finsler Eikonal Solvers
    B. Gahtan, J. Shpund, A. M. Bronstein
  • Surface Multigrid via Global Parametric Domain Simplification
    Anyu Zhao, Qing Fang, Ligang Liu
  • Circles of Confidence for Multi-Label Geometry Completion
    Z. Wei, C. Hafner, A. Kalinov, P. Heiss Synak, C. Wojtan

Deformation and Registration (Playlist)
chaired by Pierre Alliez

Wednesday, July 1, 14:00
  • As-Rigid-As-Possible Regularization for Implicit Surfaces
    T. Djuren, M. Worchel, U. Finnendahl, M. Alexa
  • On Bending in the As-Rigid-As-Possible Deformation Energy
    U. Finnendahl, M. Alexa
  • Spatial Eigenanalysis of 2D Deformation Energies
    H. Wu, K. Wu, T. Kim
  • Attention Based Optimization for 3D Shape Registration
    A. Riva, L. Olearo, S. Melzi

Poster fast forward (Video)

Wednesday, July 1, 17:00
  • TiGL 3.5 – An Open Source Parametric Geometry Library for Virtual Aircraft Design
    O. Albers, S. Goldberg, J. Kleinert, A. Reiswich
  • Exact 3D Elastica for Interactive Geometry Processing and Fabrication-Aware Design
    M. Isern
  • Topology and Combinatorics: Generalization in Deep Learning
    J.S. Schmidt, M. Carrasco, E. Röell, G. Wolf, N. Blaser, B. Rieck
  • Learning to Build Shapes by Extrusions
    T. Christiansen, K. Pandey, A. Reinders, K. Singh, M. Hannemose, J. A. Bærentzen
  • Neural Field-Based Sequence Planning for Additive-Subtractive Hybrid Manufacturing
    S. Guo, F. Zhong, L. Wang, H. Zhao
  • A Bayesian Approach to Ill-posed Geometric Primitive Fitting from Point Clouds Using Prior Knowledge
    P. Schiller, P. Raumonen, J. Peltonen, S. Ali-Löytyy
  • Geometry-Aware Edge Pooling for Graph Neural Networks
    K. Limbeck, L. Mezrag, G. Wolf, B. Rieck
  • Boundary-Aware Mesh Deformations
    F. Protais, G. Cherchi, M. Livesu
  • Stackability of architectural freeform surfaces
    A. Chocarro , K. Gavriil
  • Generalizable Dynamics Models for Deformable Objects: Tool-Agnostic Model for Tool Geometry Design
    N. Cugito, K. Allen

Meshing and Vector Field Processing (Playlist)
chaired by Guillaume Coiffier

Thursday, July 2, 11:00
  • Surface Quadrilateral Meshing from Integrable Odeco Fields
    M. Couplet , A. Chemin, D. Bommes , E. Chien
  • Meshing Unsigned Distance Fields with Regular Triangulations
    M. Kohlbrenner, M. Alexa
  • Phong-Rodrigues Extrinsic Vector-Field Processing
    H. Liu, O. Stein, A. Vaxman, M. Ben-Chen, M. Kazhdan
  • Tangent Blow-Ups for Processing Non-Manifold Geometry
    A. Petrov, M. Nabizadeh, A. Dodik, J. Solomon

Distance Fields (Playlist)
chaired by Amir Vaxman

Thursday, July 2, 14:00
  • Strictly Conservative Neural Distance Fields
    I. Ludwig, M. Campen
  • SDFs from Unoriented Point Clouds using Neural Variational Heat Distances
    S. Weidemaier, F. Hartwig, J. Sassen, S. Conti, M. Ben-Chen, M. Rumpf
  • Medial Axis Aware Learning of Signed Distance Functions
    S. Weidemaier, C. Norden-Smoch, M. Rumpf
  • Compactly supported detail field for high quality neural implicit surfaces
    G. Coiffier, J. Basselin

Hulls (Playlist)
chaired by Stephanie Wang

Thursday, July 2, 16:00

Fabrication and Verification (Playlist)
chaired by Mirela Ben-Chen

Friday, July 3, 11:00
  • Design and analysis of smooth geometry-conforming lattices via Generalized Bézier patches
    J. C. Pareja-Corcho , T. Hirschler , R. Bouclier , G. Elber , M. Barton
  • Wave-Guided Field-Aligned Volume-Filling Curves
    G. Cocco, X. Chermain
  • Taking a Moment to Characterize the Bending Response of Thin Sheet Materials
    P. Xie, J. S. Montes Maestre, S. Coros, B. Thomaszewski
  • UniGRe-3D: Unified Geometric Reconstruction for Multi-category 3D Anomaly Detection
    D. Han, Z. Zhang, Y. Gao, J. Li, M. Li, M. Zhou

Datasets and Analysis (Playlist)
chaired by Alec Jacobson

Friday, July 3, 14:00
  • Arti4D: Statistical Analysis and Modelling of the Spatio-temporal Variability in Articulated 4D Shapes
    Z. Li, A. Amrani, S. Rai, H. Laga
  • MM-CAD: A Multi-Modal CAD Dataset and Benchmark for Cross-Modal Geometric Learning
    A. Bharathi, A. Aravindakshan, R. Muthuganapathy