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

Alexander I. Bobenko

dblp:89/4795 · DBLP profile ↗
← Back
11ranked-venue papers
9as first author
4since 2021 · last 2026
0009-0008-0954-043XORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 10 · 8 first-author · 4 since 2021Theory of computation · 1 · 1 first-author

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
2 papers
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › triangulation
delaunay triangulation
0.112008
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications · SCG 2008
Computational geometry › discrete geometry
discrete differential geometry
0.112008
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications · SCG 2008
Geometric modeling and processing › discrete geometry › discrete differential geometry
discrete curvature
0.112007
Geometry of multi-layer freeform structures for architecture · ACM Trans. Graph. 2007
Geometric modeling and processing › discrete geometry
discrete differential geometry
0.112007
Geometry of multi-layer freeform structures for architecture · ACM Trans. Graph. 2007
Geometric modeling and processing › mesh processing
intrinsic triangulation
0.012008
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications · SCG 2008
Geometric modeling and processing › shape representation › mesh representation
polyhedral surface
0.012008
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications · SCG 2008

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

geodesic distance · 0.2empty disc criterion · 0.2computation and optimization · 0.1
YearPublicationVenuePosition
2026 Circular Nets with Spherical Parameter Lines and Terminating Laplace Sequences
abstract
Abstract The focus is on circular nets with one or two families of spherical parameter lines, which are treated in Möbius geometry. These circular nets provide a discretisation of surfaces with one or two families of spherical curvature lines. The special cases of planar, circular and linear parameter lines are also investigated. A Lie-geometric discretisation in terms of principal contact element nets is also presented. Its properties are analogous to the classical properties of surfaces with one or two families of spherical curvature lines. Circular nets with two families of spherical parameter lines have geometric properties that are related to Darboux cyclides. Circular nets with one or two families of spherical parameter lines are examples of Q-nets with terminating Laplace sequences. More generally, this article considers Q-nets that are inscribed in quadrics and that have terminating Laplace sequences.
Alexander I. Bobenko, Alexander Y. Fairley
Discret. Comput. Geom.1
2026 Decorated Discrete Conformal Equivalence in Non-Euclidean Geometries
abstract
Abstract We introduce decorated piecewise hyperbolic and spherical surfaces and discuss their discrete conformal equivalence. A decoration is a choice of circle about each vertex of the surface. Our decorated surfaces are closely related to inversive distance circle packings, canonical tessellations of hyperbolic surfaces, and hyperbolic polyhedra. Discrete conformal equivalence introduces an equivalence relation on decorated piecewise hyperbolic and spherical surfaces. We prove the corresponding uniformization theorem—in each equivalence class there is a unique representative on a constant curvature surface. Furthermore, we introduce a fundamental invariant characterizing the discrete conformal classes. We show that one can deform continuously between decorated piecewise hyperbolic, Euclidean, and spherical surfaces sharing the same invariant. Our approach is based on a variational principle, which also provides a way to compute the discrete uniformization and geometric transitions.
Alexander I. Bobenko, Carl O. R. Lutz
Discret. Comput. Geom.1
2021 On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs
Arseniy V. Akopyan, Alexander I. Bobenko, Wolfgang K. Schief, Jan Techter
Discret. Comput. Geom.2
2021 Nets of Lines with the Combinatorics of the Square Grid and with Touching Inscribed Conics
abstract
Abstract In the projective plane, we consider congruences of straight lines with the combinatorics of the square grid and with all elementary quadrilaterals possessing touching inscribed conics. The inscribed conics of two combinatorially neighbouring quadrilaterals have the same touching point on their common edge-line. We suggest that these nets are a natural projective generalisation of incircular nets. It is shown that these nets are planar Koenigs nets. Moreover, we show that general Koenigs nets are characterised by the existence of a 1-parameter family of touching inscribed conics. It is shown that the lines of any grid of quadrilaterals with touching inscribed conics are tangent to a common conic. These grids can be constructed via polygonal chains that are inscribed in conics. The special case of billiards in conics corresponds to incircular nets.
Alexander I. Bobenko, Alexander Y. Fairley
Discret. Comput. Geom.1
2020 Multi-Nets. Classification of Discrete and Smooth Surfaces with Characteristic Properties on Arbitrary Parameter Rectangles
Alexander I. Bobenko, Helmut Pottmann, Thilo Rörig
Discret. Comput. Geom.1
2017 Discrete Uniformization of Polyhedral Surfaces with Non-positive Curvature and Branched Covers over the Sphere via Hyper-ideal Circle Patterns
Alexander I. Bobenko, Nikolay Dimitrov, Stefan Sechelmann
Discret. Comput. Geom.1
2014 Discrete constant mean curvature nets in space forms: Steiner's formula and Christoffel duality
Alexander I. Bobenko, Udo Hertrich-Jeromin, Inna Lukyanenko
Discret. Comput. Geom.1
2008 Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications
abstract
A simplicial surface provides its carrier with a natural triangulation whose vertex set includes the cone points and the corners of the boundary. However, this triangulation is not intrinsically distinguished from other triangulations with the same vertex set, it is not preserved under isometric deformations of the surface. Delaunay tessellations of polyhedral surfaces are defined intrinsically in terms of empty discs on surfaces. The edges of Delaunay tessellations are geodesics on the original polyhedral surface (and not necessarily straight edges in the 3-space). For any polyhedral surface there exists a unique Delaunay tessellation. It is not necessarily strongly regular, i.e. the intersection of two closed cells may not be a single closed cell.
Alexander I. Bobenko
SCG1
2007 A Discrete Laplace-Beltrami Operator for Simplicial Surfaces
Alexander I. Bobenko, Boris Springborn
Discret. Comput. Geom.1
2007 Geometry of multi-layer freeform structures for architecture
abstract
The geometric challenges in the architectural design of freeform shapes come mainly from the physical realization of beams and nodes. We approach them via the concept of parallel meshes, and present methods of computation and optimization. We discuss planar faces, beams of controlled height, node geometry, and multilayer constructions. Beams of constant height are achieved with the new type of edge offset meshes. Mesh parallelism is also the main ingredient in a novel discrete theory of curvatures. These methods are applied to the construction of quadrilateral, pentagonal and hexagonal meshes, discrete minimal surfaces, discrete constant mean curvature surfaces, and their geometric transforms. We show how to design geometrically optimal shapes, and how to find a meaningful meshing and beam layout for existing shapes.
Helmut Pottmann, Yang Liu 0014, Johannes Wallner 0001, Alexander I. Bobenko, Wenping Wang 0001
ACM Trans. Graph.4
2005 Discrete Willmore Flow
Alexander I. Bobenko, Peter Schröder
Symposium on Geometry Processing1