Related papers: Smooth Bezier Surfaces over Arbitrary Quadrilatera…
A continuum description of unstructured meshes in two dimensions, both for planar and curved surface domains, is proposed. The meshes described are those which, in the limit of an increasingly finer mesh (smaller cells), and away from…
We generalize our earlier results concerning meshfree collocation methods for semilinear elliptic second order problems to the quasilinear case. The stability question, however, is treated differently, namely by extending a paper on…
Pavarino proved that the additive Schwarz method with vertex patches and a low-order coarse space gives a $p$-robust solver for symmetric and coercive problems. However, for very high polynomial degree it is not feasible to assemble or…
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
We analyze a new framework for expressing finite element methods on arbitrarily many intersecting meshes: multimesh finite element methods. The multimesh finite element method, first presented in [40], enables the use of separate meshes to…
We present a novel family of $C^1$ quadrilateral finite elements, which define global $C^1$ spaces over a general quadrilateral mesh with vertices of arbitrary valency. The elements extend the construction by (Brenner and Sung, J. Sci.…
We introduce an algorithm to remesh triangle meshes representing developable surfaces to planar quad dominant meshes. The output of our algorithm consists of planar quadrilateral (PQ) strips that are aligned to principal curvature…
The notions of discrete conformality on triangle meshes have rich mathematical theories and wide applications. The related notions of discrete uniformizations on triangle meshes, suggest efficient methods for computing the uniformizations…
We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing…
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…
This paper presents a complete Pascal interpolation scheme for use in the plane geometry mapping applied in association with numerical methods. The geometry of a domain element is approximated by a complete Pascal polynomial. The…
Given a system of triangles in the plane $\mathbb{R}^2$ along with given data of function and gradient values at the vertices, we describe the general pattern of local linear methods invoving only four smooth standard shape functions which…
This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…
We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Pad\'e approximation problem in [Van Barel and…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
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 use the "closed point sieve" to prove a variant of a Bertini theorem over finite fields. Specifically, given a smooth quasi-projective subscheme X of P^n of dimension m over F_q, and a closed subscheme Z in P^n such that Z intersect X is…
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…
Recent developments for mathematical modeling and numerical simulation of biomolecular systems raise new demands for qualified, stable, and efficient surface meshing, especially in implicit-solvent modeling. In our former work, we have…