Related papers: Smooth surface interpolation using patches with ra…
In CAGD the design of a surface that interpolates an arbitrary quadrilateral mesh is definitely a challenging task. The basic requirement is to satisfy both criteria concerning the regularity of the surface and aesthetic concepts. With…
It is well known that one can find a rational normal curve in $\mathbb P^n$ through $n+3$ general points. We prove a generalization of this to higher dimensional varieties, showing that smooth varieties of minimal degree can be interpolated…
A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…
This paper is devoted to the construction of polynomial 2-surfaces which possess a polynomial area element. In particular we study these surfaces in the Euclidean space $\mathbb R^3$ (where they are equivalent to the PN surfaces) and in the…
We present a new and general framework for convolutional neural network operations on spherical (or omnidirectional) images. Our approach represents the surface as a graph of connected points that doesn't rely on a particular sampling…
In this paper we apply the INTERNODES method to solve second order elliptic problems discretized by Isogeometric Analysis methods on non-conforming multiple patches in 2D and 3D geometries. INTERNODES is an interpolation-based method that,…
Using a residuum approach, we provide a complete description of the space of the rational spatial curves of given tangent directions. The rational Pythagorean hodograph curves are obtained as a special case when the norm of the direction…
In this short note we describe a simple adaptation of biharmonic surfaces to interpolate boundary cross-derivatives given in ribbon form, and compare with the recently proposed Generalized B-spline patches.
A key step in any scanning-based asset creation workflow is to convert unordered point clouds to a surface. Classical methods (e.g., Poisson reconstruction) start to degrade in the presence of noisy and partial scans. Hence, deep learning…
A large amount of quantitative geospatial data are collected and aggregated in discrete enumeration units (e.g. countries or states). Smooth pycnophylactic interpolation aims to find a smooth, nonnegative function such that the area…
Multi-sided surfaces are often defined by side interpolants (also called ribbons), i.e. the surface has to connect to the ribbons with a prescribed degree of smoothness. The I-patch is such a family of implicit surfaces capable of…
We examine implicit representations of parametric or point cloud models, based on interpolation matrices, which are not sensitive to base points. We show how interpolation matrices can be used for ray shooting of a parametric ray with a…
Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a…
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$…
This paper presents a method for mathematical modelling of surfaces conditioned on empirical data. It is based on solving a discrete biharmonic equation over a domain with given inner point and inner curve data. The inner curve data is used…
In a series of papers (Lombardi & Schneider 2001, 2002) we studied in detail the statistical properties of an interpolation technique widely used in astronomy. In particular, we considered the average interpolated map and its covariance…
We present a local interpolation method in four dimensions utilising cubic splines. An extension of the three-dimensional tricubic method, the interpolated function has C$^1$ continuity and its partial derivatives are analytically…
Marching surfaces is a method for isosurface extraction and approximation based on a $G^1$ multi-sided patch interpolation scheme. Given a 3D grid of scalar values, an underlying curve network is formed using second order information and…
This paper is concerned with applications of the theory of approximation and interpolation based on compensated convex transforms developed in [K. Zhang, E. Crooks, A. Orlando, Compensated convexity methods for approximations and…
Generating realistic intermediate shapes between non-rigidly deformed shapes is a challenging task in computer vision, especially with unstructured data (e.g., point clouds) where temporal consistency across frames is lacking, and…