Related papers: Manifold-based isogeometric analysis basis functio…
Round fold maps are smooth maps on closed manifolds which are locally represented as the product maps of Morse functions and identity maps on open disks and whose singularity is realized as concentrically embedded spheres. The author…
In computer graphics, smooth data reconstruction on 2D or 3D manifolds usually refers to subdivision problems. Such a method is only valid based on dense sample points. The manifold usually needs to be triangulated into meshes (or patches)…
The state of art of electromagnetic integral equations has seen significant growth over the past few decades, overcoming some of the fundamental bottlenecks: computational complexity, low frequency and dense discretization breakdown,…
Easy to construct and optimally convergent generalisations of B-splines to unstructured meshes are essential for the application of isogeometric analysis to domains with non-trivial topologies. Nonetheless, especially for hexahedral meshes,…
We propose the Manifold Function Encoder (MFE) for identifying different functions defined on different manifolds. Both a manifold in Euclidean space and a function defined on this manifold can be viewed as bounded linear functionals on a…
Isogeometric analysis was proposed to bridge the gap between computer-aided design and numerical discretization. However, standard multi-patch isogeometric analysis mandates conformal discretizations across patch interfaces, posing…
Data from individual observations can originate from various sources or modalities but are often intrinsically linked. Multimodal data integration can enrich information content compared to single-source data. Manifold alignment is a form…
In order to perform isogeometric analysis with increased smoothness on complex domains, trimming, variational coupling or unstructured spline methods can be used. The latter two classes of methods require a multi-patch segmentation of the…
We study the space of $C^{2}$-smooth isogeometric functions on bilinearly parameterized multi-patch domains $\Omega \subset \mathbb{R}^{2}$, where the graph of each isogeometric function is a multi-patch spline surface of bidegree $(d,d)$,…
Embedding graphs in continous spaces is a key factor in designing and developing algorithms for automatic information extraction to be applied in diverse tasks (e.g., learning, inferring, predicting). The reliability of graph embeddings…
Isogeometric analysis (IGA) is a numerical method that connects computer-aided design (CAD) with finite element analysis (FEA). In CAD the computational domain is usually represented by B-spline or NURBS patches. Given a NURBS…
Inspired by the Taubes-Wu construction of $\mathcal{C}^{1,\alpha}$ two-valued harmonic functions by the use of symmetry, we construct minimal surfaces with stratified branching sets as graphs of $\mathcal{C}^{1,\alpha}$ two-valued…
In the chapter "Multiresolution Analysis on Compact Riemannian Manifolds" Isaac Pesenson describes multiscale analysis, sampling, interpolation and approximation of functions defined on manifolds. His main achievements are: construction on…
We construct over a given bilinear multi-patch domain a novel $C^s$-smooth mixed degree and regularity isogeometric spline space, which possesses the degree $p=2s+1$ and regularity $r=s$ in a small neighborhood around the edges and…
Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…
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…
We present a novel isogeometric collocation method for solving the Poisson's and the biharmonic equation over planar bilinearly parameterized multi-patch geometries. The proposed approach relies on the use of a modified construction of the…
We describe a two-level method for computing a function whose zero-level set is the surface reconstructed from given points scattered over the surface and associated with surface normal vectors. The function is defined as a linear…
We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any…