Related papers: Parallelizable global quasi-conformal parameteriza…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
Numerous applications require the simultaneous redistribution of the irradiance and phase of a laser beam. The beam shape is thereby determined by the respective application. An elegant way to control the irradiance and phase at the same…
Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…
We show that, given a non-degenerate, finitely connected domain $D$, its boundary, and the number of its boundary components, it is possible to compute a conformal mapping of $D$ onto a circular domain \emph{without} prior knowledge of the…
In this paper, we propose a stochastic geometric iterative method to approximate the high-resolution 3D models by finite Loop subdivision surfaces. Given an input mesh as the fitting target, the initial control mesh is generated using the…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
Significant research effort has been devoted to improving the performance of join processing in the massively parallel computation model, where the goal is to evaluate a query with the minimum possible data transfer between machines.…
The growing need for creating surfaces with specific wetting properties, such as superhyrdophobic behavior, asks for novel methods for their efficient design. In this work, a fast computational method for the evaluation of patterned…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
We present a constructive approach for approximating the conformal map (uniformization) of a polyhedral surface to a canonical domain in the plane. The main tool is a characterization of convex spaces of quasiconformal simplicial maps and…
Surface comparison and matching is a challenging problem in computer vision. While reparametrization-invariant Sobolev metrics provide meaningful elastic distances and point correspondences via the geodesic boundary value problem, solving…
This paper presents a novel meta algorithm, Partition-Merge (PM), which takes existing centralized algorithms for graph computation and makes them distributed and faster. In a nutshell, PM divides the graph into small subgraphs using our…
As humans, we regularly associate shape of an object with its built material. In the context of geometric modeling, however, this interrelation between form and material is rarely explored. In this work, we propose a novel data-driven…
We propose a patchwise local Fourier extension method for approximating smooth functions on general two dimensional domains with curved boundaries. The domain is embedded into a Cartesian background grid and decomposed into rectangular…
Polycube-maps are used as base-complexes in various fields of computational geometry, including the generation of regular all-hexahedral meshes free of internal singularities. However, the strict alignment constraints behind polycube-based…
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…
An estimation of the sky signal from streams of Time Ordered Data (TOD) acquired by Cosmic Microwave Background (\cmb) experiments is one of the most important steps in the context of \cmb data analysis referred to as the map-making…
We propose a novel Moebius interpolator that takes as an input a discrete map between the vertices of two planar triangle meshes, and outputs a smooth map on the input domain. The output map interpolates the discrete map, is continuous…
Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…