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

Christian Müller 0005

dblp:50/5380-5 · DBLP profile ↗
← Back
13ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0002-9240-4816ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 12 · 2 first-author · 4 since 2021Theory of computation · 1 · 1 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
9 papers
Geometric modeling and processing · 79% Computational fabrication · 19% Rendering · 2%

Topics — the 13 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
mesh generation
0.922023
Meshes with Spherical Faces · ACM Trans. Graph. 2023
Regular meshes from polygonal patterns · ACM Trans. Graph. 2017
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 › discrete geometry
discrete differential geometry
0.832020
Principal symmetric meshes · ACM Trans. Graph. 2020
Regular meshes from polygonal patterns · ACM Trans. Graph. 2017
Canonical Möbius subdivision · ACM Trans. Graph. 2018
Geometric modeling and processing
surface fitting
0.812024
Approximation by Meshes with Spherical Faces · ACM Trans. Graph. 2024
Geometric modeling and processing › shape modeling
architectural geometry
0.622024
Discrete geodesic parallel coordinates · ACM Trans. Graph. 2019
Approximation by Meshes with Spherical Faces · ACM Trans. Graph. 2024
Geometric modeling and processing › shape modeling › shape editing
mesh editing
0.422018
Canonical Möbius subdivision · ACM Trans. Graph. 2018
Conformal mesh deformations with Möbius transformations · ACM Trans. Graph. 2015
Geometric modeling and processing
surface parameterization
0.412019
Discrete geodesic parallel coordinates · ACM Trans. Graph. 2019
Geometric modeling and processing
subdivision surfaces
0.312018
Canonical Möbius subdivision · ACM Trans. Graph. 2018
Geometric modeling and processing › shape deformation
conformal deformation
0.212015
Conformal mesh deformations with Möbius transformations · ACM Trans. Graph. 2015
Geometric modeling and processing › discrete geometry › discrete differential geometry
discrete conformal equivalence
0.212015
Conformal mesh deformations with Möbius transformations · ACM Trans. Graph. 2015
Geometric modeling and processing
mesh deformation
0.212015
Conformal mesh deformations with Möbius transformations · ACM Trans. Graph. 2015
Geometric modeling and processing › mesh processing
mesh optimization
0.112017
Regular meshes from polygonal patterns · ACM Trans. Graph. 2017

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

simulation · 0.9möbius geometry · 0.8sphere congruence optimization · 0.8optimization-based roughening · 0.8line congruence · 0.8isotropic geometry · 0.8non-euclidean geometry characterization · 0.7möbius invariant discrete surface theory · 0.7laguerre geometry · 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.4
2024 Approximation by Meshes with Spherical Faces
abstract
Meshes with spherical faces and circular edges are an attractive alternative to polyhedral meshes for applications in architecture and design. Approximation of a given surface by such a mesh needs to consider the visual appearance, approximation quality, the position and orientation of circular intersections of neighboring faces and the existence of a torsion free support structure that is formed by the planes of circular edges. The latter requirement implies that the mesh simultaneously defines a second mesh whose faces lie on the same spheres as the faces of the first mesh. It is a discretization of the two envelopes of a sphere congruence, i.e., a two-parameter family of spheres. We relate such sphere congruences to torsal parameterizations of associated line congruences. Turning practical requirements into properties of such a line congruence, we optimize line and sphere congruence as a basis for computing a mesh with spherical triangular or quadrilateral faces that approximates a given reference surface.
Anthony S. Ramos Cisneros, Martin Kilian, Alisher Aikyn, Helmut Pottmann, Christian Müller 0005
ACM Trans. Graph.5
2024 Designing triangle meshes with controlled roughness
abstract
Motivated by the emergence of rough surfaces in various areas of design, we address the computational design of triangle meshes with controlled roughness. Our focus lies on small levels of roughness. There, roughness or smoothness mainly arises through the local positioning of the mesh edges and faces with respect to the curvature behavior of the reference surface. The analysis of this interaction between curvature and roughness is simplified by a 2D dual diagram and its generation within so-called isotropic geometry, which may be seen as a structure-preserving simplification of Euclidean geometry. Isotropic dihedral angles of the mesh are close to the Euclidean angles and appear as Euclidean edge lengths in the dual diagram, which also serves as a tool for visualization and interactive local design. We present a computational framework that includes appearance-aware remeshing, optimization-based automatic roughening, and control of dihedral angles.
Victor Ceballos Inza, Panagiotis Fykouras, Florian Rist 0001, Daniel Häseker, Majid Hojjat, Christian Müller 0005, Helmut Pottmann
ACM Trans. Graph.6
2023 Meshes with Spherical Faces
abstract
Discrete surfaces with spherical faces are interesting from a simplified manufacturing viewpoint when compared to other double curved face shapes. Furthermore, by the nature of their definition they are also appealing from the theoretical side leading to a Möbius invariant discrete surface theory. We therefore systematically describe so called sphere meshes with spherical faces and circular arcs as edges where the Möbius transformation group acts on all of its elements. Driven by aspects important for manufacturing, we provide the means to cluster spherical panels by their radii. We investigate the generation of sphere meshes which allow for a geometric support structure and characterize all such meshes with triangular combinatorics in terms of non-Euclidean geometries. We generate sphere meshes with hexagonal combinatorics by intersecting tangential spheres of a reference surface and let them evolve - guided by the surface curvature - to visually convex hexagons, even in negatively curved areas. Furthermore, we extend meshes with circular faces of all combinatorics to sphere meshes by filling its circles with suitable spherical caps and provide a remeshing scheme to obtain quadrilateral sphere meshes with support structure from given sphere congruences. By broadening polyhedral meshes to sphere meshes we exploit the additional degrees of freedom to minimize intersection angles of neighboring spheres enabling the use of spherical panels that provide a softer perception of the overall surface.
Martin Kilian, Anthony S. Ramos Cisneros, Christian Müller 0005, Helmut Pottmann
ACM Trans. Graph.3
2021 Geometric Criteria for Realizability of Tensegrities in Higher Dimensions
abstract
In this paper we study a classical Maxwell question on the existence of self-stresses for frameworks, which are called tensegrities. We give a complete answer on geometric conditions of at most $(d+1)$-valent tensegrities in $d$-dimensional space both in terms of discrete multiplicative 1-forms and in terms of “join” and “intersection” operations in projective geometry.
Oleg Karpenkov, Christian Müller 0005
SIAM J. Discret. Math.2
2020 Discretizations of Surfaces with Constant Ratio of Principal Curvatures
abstract
Motivated by applications in architecture, we study surfaces with a constant ratio of principal curvatures. These surfaces are a natural generalization of minimal surfaces, and can be constructed by applying a Christoffel-type transformation to appropriate spherical curvature line parametrizations, both in the smooth setting and in a discretization with principal nets. We link this Christoffel-type transformation to the discrete curvature theory for parallel meshes and characterize nets that admit these transformations. In the case of negative curvature, we also present a discretization of asymptotic nets. This case is suitable for design and computation, and forms the basis for a special type of architectural support structures, which can be built by bending flat rectangular strips of inextensible material, such as sheet metal.
Michael R. Jimenez, Christian Müller 0005, Helmut Pottmann
Discret. Comput. Geom.2
2020 Principal symmetric meshes
abstract
The isolines of principal symmetric surface parametrizations run symmetrically to the principal directions. We describe two discrete versions of these special nets/quad meshes which are dual to each other and show their usefulness for various applications in the context of fabrication and architectural design. Our discretization of a principal symmetric mesh comes naturally with a family of spheres, the so-called Meusnier and Mannheim spheres. In our representation of principal symmetric meshes, we have direct control over the radii of theses spheres and the intersection angles of the parameter lines. This facilitates tasks such as generating Weingarten surfaces including constant mean curvature surfaces and minimal surfaces. We illustrate the potential of Weingarten surfaces for paneling doubly curved freeform facades by significantly reducing the number of necessary molds. Moreover, we have direct access to curvature adaptive tool paths for cylindrical CNC milling with circular edges as well as flank milling with rotational cones. Furthermore, the construction of curved support structures from congruent circular strips is easily managed by constant sphere radii. The underlying families of spheres are in a natural way discrete curvature spheres in analogy to smooth Möbius and Laguerre geometry which further leads to a novel discrete curvature theory for principal symmetric meshes.
Davide Pellis, Hui Wang 0064, Martin Kilian, Florian Rist 0001, Helmut Pottmann, Christian Müller 0005
ACM Trans. Graph.6
2019 Discrete geodesic parallel coordinates
abstract
Geodesic parallel coordinates are orthogonal nets on surfaces where one of the two families of parameter lines are geodesic curves. We describe a discrete version of these special surface parameterizations and show that they are very useful for specific applications, most of which are related to the design and fabrication of surfaces in architecture. With the new discrete surface model, it is easy to control strip widths between neighboring geodesics. This facilitates tasks such as cladding a surface with strips of originally straight flat material or designing geodesic gridshells and timber rib shells. It is also possible to model nearly developable surfaces. These are characterized by geodesic strips with almost constant strip widths and are used for generating shapes that can be manufactured from materials which allow for some stretching or shrinking like felt, leather, or thin wooden boards. Most importantly, we show how to constrain the strip width parameters to model a class of intrinsically symmetric surfaces. These surfaces are isometric to surfaces of revolution and can be covered with doubly-curved panels that are produced with only a few molds when working with flexible materials like metal sheets.
Hui Wang 0064, Davide Pellis, Florian Rist 0001, Helmut Pottmann, Christian Müller 0005
ACM Trans. Graph.5
2018 Canonical Möbius subdivision
abstract
We present a novel framework for creating Möbius-invariant subdivision operators with a simple conversion of existing linear subdivision operators. By doing so, we create a wide variety of subdivision surfaces that have properties derived from Möbius geometry; namely, reproducing spheres, circular arcs, and Möbius regularity. Our method is based on establishing a canonical form for each 1-ring in the mesh, representing the class of all 1-rings that are Möbius equivalent to that 1-ring. We perform a chosen linear subdivision operation on these canonical forms, and blend the positions contributed from adjacent 1-rings, using two novel Möbius-invariant operators, into new face and edge points. The generality of the method allows for easy coarse-to-fine mesh editing with diverse polygonal patterns, and with exact reproduction of circular and spherical features. Our operators are in closed-form and their computation is as local as the computation of the linear operators they correspond to, allowing for efficient subdivision mesh editing and optimization.
Amir Vaxman, Christian Müller 0005, Ofir Weber
ACM Trans. Graph.2
2017 Regular meshes from polygonal patterns
abstract
We present a framework for designing shapes from diverse combinatorial patterns, where the vertex 1-rings and the faces are as rotationally symmetric as possible, and define such meshes as regular. Our algorithm computes the geometry that brings out the symmetries encoded in the combinatorics. We then allow designers and artists to envision and realize original meshes with great aesthetic qualities. Our method is general and applicable to meshes of arbitrary topology and connectivity, from triangle meshes to general polygonal meshes. The designer controls the result by manipulating and constraining vertex positions. We offer a novel characterization of regularity, using quaternionic ratios of mesh edges, and optimize meshes to be as regular as possible according to this characterization. Finally, we provide a mathematical analysis of these regular meshes, and show how they relate to concepts like the discrete Willmore energy and connectivity shapes.
Amir Vaxman, Christian Müller 0005, Ofir Weber
ACM Trans. Graph.2
2015 Conformal mesh deformations with Möbius transformations
abstract
We establish a framework to design triangular and circular polygonal meshes by using face-based compatible Möbius transformations. Embracing the viewpoint of surfaces from circles, we characterize discrete conformality for such meshes, in which the invariants are circles, cross-ratios, and mutual intersection angles. Such transformations are important in practice for editing meshes without distortions or loss of details. In addition, they are of substantial theoretical interest in discrete differential geometry. Our framework allows for handle-based deformations, and interpolation between given meshes with controlled conformal error.
Amir Vaxman, Christian Müller 0005, Ofir Weber
ACM Trans. Graph.2
2014 On Discrete Constant Mean Curvature Surfaces
Christian Müller 0005
Discret. Comput. Geom.1
2010 Oriented Mixed Area and Discrete Minimal Surfaces
Christian Müller 0005, Johannes Wallner 0001
Discret. Comput. Geom.1