Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Felix Dellinger

dblp:245/4856 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0001-6155-0928ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 3 first-author · 4 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
3 papers
Geometric modeling and processing · 73% Computational fabrication · 27%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational fabrication › structural design
deployable structures
0.912025
Snapping Deployable Toroids for Modular Gridshells · ACM Trans. Graph. 2025
Geometric modeling and processing › shape decomposition
surface decomposition
0.912025
Snapping Deployable Toroids for Modular Gridshells · ACM Trans. Graph. 2025
Geometric modeling and processing › shape modeling › surface geometry
developable surface
0.512021
Using isometries for computational design and fabrication · ACM Trans. Graph. 2021
Geometric modeling and processing › shape modeling › architectural geometry
panelization
0.512021
Using isometries for computational design and fabrication · ACM Trans. Graph. 2021
Geometric modeling and processing › discrete geometry › discrete differential geometry
discrete curvature
0.412019
Visual smoothness of polyhedral surfaces · ACM Trans. Graph. 2019
Geometric modeling and processing
mesh generation
0.412019
Visual smoothness of polyhedral surfaces · ACM Trans. Graph. 2019
Geometric modeling and processing › shape representation › mesh representation
polyhedral surface
0.412019
Visual smoothness of polyhedral surfaces · ACM Trans. Graph. 2019
Geometric modeling and processing › shape modeling
architectural geometry
0.112019
Visual smoothness of polyhedral surfaces · ACM Trans. Graph. 2019

Methods — techniques the papers use, named apart from their topics

simulation · 0.9killing vector field · 0.5discrete isometric mapping · 0.5curved folding · 0.5energy minimization · 0.4discrete differential geometry · 0.4
YearPublicationVenuePosition
2025 Snapping Deployable Toroids for Modular Gridshells
abstract
We introduce a novel class of polyhedral tori (PQ-toroids) that snap between two stable configurations - a flat state and a deployed one separated by an energy barrier. Being able to create PQ-toroids from any set of given planar bottom and side faces opens the possibility to assemble the bistable blocks into a thick freeform curved shell structure to follow a planar quadrilateral (PQ) net with coplanar adjacent offset directions. A design pipeline is developed and presented for inversely computing PQ-toroid modules using conjugate net decompositions of a given surface. We analyze the snapping behavior and energy barriers through simulation and build physical prototypes to validate the feasibility of the proposed system. This work expands the geometric design space of multistable origami for lightweight modular structures and offers practical applications in architectural and deployable systems.
Felix Dellinger, Martin Kilian, Munkyun Lee, Christian Müller 0005, Georg Nawratil, Tomohiro Tachi, Kiumars Sharifmoghaddam
ACM Trans. Graph.1
2024 Discrete Isothermic Nets Based on Checkerboard Patterns
abstract
This paper studies the discrete differential geometry of the checkerboard pattern inscribed in a quadrilateral net by connecting edge midpoints. It turns out to be a versatile tool which allows us to consistently define principal nets, Koenigs nets and eventually isothermic nets as a combination of both. Principal nets are based on the notions of orthogonality and conjugacy and can be identified with sphere congruences that are entities of Möbius geometry. Discrete Koenigs nets are defined via the existence of the so-called conic of Koenigs. We find several interesting properties of Koenigs nets, including their being dualizable and having equal Laplace invariants. Isothermic nets can be defined as Koenigs nets that are also principal nets. We prove that the class of isothermic nets is invariant under both dualization and Möbius transformations. Among other things, this allows a natural construction of discrete minimal surfaces and their Goursat transformations.
Felix Dellinger
Discret. Comput. Geom.1
2023 Discrete orthogonal structures
Felix Dellinger, Hui Wang 0064
Comput. Graph.1
2021 Using isometries for computational design and fabrication
abstract
We solve the task of representing free forms by an arrangement of panels that are manufacturable by precise isometric bending of surfaces made from a small number of molds. In fact we manage to solve the paneling task with surfaces of constant Gaussian curvature alone. This includes the case of developable surfaces which exhibit zero curvature. Our computations are based on an existing discrete model of isometric mappings between surfaces which for this occasion has been refined to obtain higher numerical accuracy. Further topics are interesting connections of the paneling problem with the geometry of Killing vector fields, designing and actuating isometries, curved folding in the double-curved case, and quad meshes with rigid faces that are nevertheless flexible.
Caigui Jiang, Hui Wang 0064, Victor Ceballos Inza, Felix Dellinger, Florian Rist 0001, Johannes Wallner 0001, Helmut Pottmann
ACM Trans. Graph.4
2019 Visual smoothness of polyhedral surfaces
abstract
Representing smooth geometric shapes by polyhedral meshes can be quite difficult in situations where the variation of edges and face normals is prominently visible. Especially problematic are saddle-shaped areas of the mesh, where typical vertices with six incident edges are ill suited to emulate the more symmetric smooth situation. The importance of a faithful discrete representation is apparent for certain special applications like freeform architecture, but is also relevant for simulation and geometric computing. In this paper we discuss what exactly is meant by a good representation of saddle points, and how this requirement is stronger than a good approximation of a surface plus its normals. We characterize good saddles in terms of the normal pyramid in a vertex. We show several ways to design meshes whose normals enjoy small variation (implying good saddle points). For this purpose we define a discrete energy of polyhedral surfaces, which is related to a certain total absolute curvature of smooth surfaces. We discuss the minimizers of both functionals and in particular show that the discrete energy is minimal not for triangle meshes, but for principal quad meshes. We demonstrate our procedures for optimization and interactive design by means of meshes intended for architectural design.
Davide Pellis, Martin Kilian, Felix Dellinger, Johannes Wallner 0001, Helmut Pottmann
ACM Trans. Graph.3