Demo Data from EDBT 2026 / reviewers in the wild / expert
Michael Quicke
dblp:13/173
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Geometric modeling and processing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing
mesh processing |
0.0 | 1 | 2000 | Parameterization of Closed Surfaces for Parametric Surface Descriptio · CVPR 2000 |
Geometric modeling and processing › mesh processing
multiresolution mesh |
0.0 | 1 | 2000 | Parameterization of Closed Surfaces for Parametric Surface Descriptio · CVPR 2000 |
Geometric modeling and processing › surface parameterization
spherical parameterization |
0.0 | 1 | 2000 | Parameterization of Closed Surfaces for Parametric Surface Descriptio · CVPR 2000 |
Geometric modeling and processing
surface parameterization |
0.0 | 1 | 2000 | Parameterization of Closed Surfaces for Parametric Surface Descriptio · CVPR 2000 |
Methods — techniques the papers use, named apart from their topics
multi-resolution mesh hierarchy · 0.0harmonic mapping · 0.0constrained optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Parameterization of Closed Surfaces for Parametric Surface DescriptioabstractA procedure for the parameterization of surface meshes of objects with spherical topology is presented. The generation of such a parameterisation has been formulated and solved as a large constrained optimization problem by C. Brechbuhler (1995), but the convergence of this algorithm becomes unstable for object meshes consisting of several thousand vertices. We propose a new more stable algorithm to overcome this problem using multi-resolution meshes. A triangular mesh is mapped to a sphere by harmonic mapping. Next, a mesh hierarchy is constructed. The coarsest level is then optimized using a modification of the original procedure to map object surfaces to the unit sphere. The result is used as a starting point for the mapping of the next finer mesh, a process which is repeated until the final result is obtained. The new approach is compared to the original one and some parameterized object surfaces are presented. Michael Quicke, Christian Brechbühler, Johannes Hug, Hans Blattman, Gábor Székely |
CVPR | 1 |