Related papers: Parallelizable global conformal parameterization o…
We develop a new optimisation technique that combines multiresolution subdivision surfaces for boundary description with immersed finite elements for the discretisation of the primal and adjoint problems of optimisation. Similar to wavelets…
An algorithm for the computation of global discrete conformal parametrizations with prescribed global holonomy signatures for triangle meshes was recently described in [Campen and Zorin 2017]. In this paper we provide a detailed analysis of…
In this paper, we propose a new variational framework for 3D surface denoising over triangulated meshes, which is inspired by the success of semi-sparse regularization in image processing. Differing from the uniformly sampled image data,…
Intrinsic isometric shape matching has become the standard approach for pose invariant correspondence estimation among deformable shapes. Most existing approaches assume global consistency, i.e., the metric structure of the whole manifold…
We consider the problem of finding a continuous and non-rigid matching between a 2D contour and a 3D mesh. While such problems can be solved to global optimality by finding a shortest path in the product graph between both shapes, existing…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
Geometric consistency, i.e. the preservation of neighbourhoods, is a natural and strong prior in 3D shape matching. Geometrically consistent matchings are crucial for many downstream applications, such as texture transfer or statistical…
Three-dimensional nanoarchitectures are widely used across various areas of physics, including spintronics, photonics, and superconductivity. In this regard, thin curved 3D membranes are especially interesting for applications in nano- and…
This paper introduces a new method to stylize 3D geometry. The key observation is that the surface normal is an effective instrument to capture different geometric styles. Centered around this observation, we cast stylization as a shape…
We consider sequential and parallel decomposition methods for a dual problem of a general total variation minimization problem with applications in several image processing tasks, like image inpainting, estimation of optical flow and…
We address the problem of surface inpainting, which aims to fill in holes or missing regions on a Riemann surface based on its surface geometry. In practical situation, surfaces obtained from range scanners often have holes where the 3D…
The parameterization of closed surfaces typically requires either multiple charts or a non-planar domain to achieve a seamless global mapping. In this paper, we propose a numerical framework for the seamless parameterization of genus-zero…
Stiffener layout optimization of complex surfaces is fulfilled within the framework of topology optimization. A combined parameterization method is developed in two aspects. One is to parameterize the material distribution of the stiffener…
We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage…
We present a general method for computing local parameterizations rooted at a point on a surface, where the surface is described only through a signed implicit function and a corresponding projection function. Using a two-stage process, we…
Finding correspondences between 3D deformable shapes is an important and long-standing problem in geometry processing, computer vision, graphics, and beyond. While various shape matching datasets exist, they are mostly static or limited in…
SLE curves describe the scaling limit of interfaces from many 2D lattice models. Heuristically speaking, the SLE partition function is the continuum counterpart of the partition function of the corresponding discrete model. It is well known…
Point discretization of curved surfaces is required in many applications ranging from object rendering to the solution of surface partial differential equations (PDEs). These applications often impose that surfaces are sampled with local…
Surface parameterizations have been widely applied to computer graphics and digital geometry processing. In this paper, we propose a novel stretch energy minimization (SEM) algorithm for the computation of equiareal parameterizations of…
We describe a method for discretizing planar C2-regular domains immersed in non-conforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the…