Related papers: Efficient conformal parameterization of multiply-c…
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good…
In this paper we study the local behavior of solutions to some free boundary problems. We relate the theory of quasi-conformal maps to the regularity of the solutions to nonlinear thin-obstacle problems; we prove that the contact set is…
Identifying the underlying models in a set of data points contaminated by noise and outliers, leads to a highly complex multi-model fitting problem. This problem can be posed as a clustering problem by the projection of higher order…
In computer vision and medical imaging, the problem of matching structures finds numerous applications from automatic annotation to data reconstruction. The data however, while corresponding to the same anatomy, are often very different in…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
This paper addresses the challenges of designing mesh convolution neural networks for 3D mesh dense prediction. While deep learning has achieved remarkable success in image dense prediction tasks, directly applying or extending these…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
We consider the decoupling theory of a broad class of $C^5$ surfaces $\mathbb{M} \subset \mathbb{R}^3$ lacking planar points. In particular, our approach also applies to surfaces which are not graphed by mixed homogeneous polynomials. The…
Roughly speaking, let us say that a map between metric spaces is large scale conformal if it maps packings by large balls to large quasi-balls with limited overlaps. This quasi-isometry invariant notion makes sense for finitely generated…
This paper proposes a composable fine-tuning method that integrates graph structural priors with modular adapters to address the high computational cost and structural instability faced by large-scale pre-trained models in multi-task…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
We suggest a novel shape matching algorithm for three-dimensional surface meshes of disk or sphere topology. The method is based on the physical theory of nonlinear elasticity and can hence handle large rotations and deformations.…
We introduce a corrective function to compensate errors in contact area computations coming from mesh discretization. The correction is based on geometrical arguments and requires only one additional quantity to be computed: the length of…
Planar homography, with eight degrees of freedom (DOFs), is fundamental in numerous computer vision tasks. While the positional offsets of four corners are widely adopted (especially in neural network predictions), this parameterization…
We introduce the isogeometric shape optimisation of thin shell structures using subdivision surfaces. Both triangular Loop and quadrilateral Catmull-Clark subdivision schemes are considered for geometry modelling and finite element…
Although 3D shape matching and interpolation are highly interrelated, they are often studied separately and applied sequentially to relate different 3D shapes, thus resulting in sub-optimal performance. In this work we present a unified…
We propose a new method to obtain landmark-matching transformations between n-dimensional Euclidean spaces with large deformations. Given a set of feature correspondences, our algorithm searches for an optimal folding-free mapping that…
Roughly, a conformal tiling of a Riemann surface is a tiling where each tile is a suitable conformal image of a Euclidean regular polygon. In 1997, Bowers and Stephenson constructed an edge-to-edge conformal tiling of the complex plane…
In these Notes, a comprehensive description of the universal fractal geometry of conformally-invariant scaling curves or interfaces, in the plane or half-plane, is given. The present approach focuses on deriving critical exponents…