Related papers: Analysis-suitable $G^1$ multi-patch parametrizatio…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
In this paper, we describe a general class of $C^1$ smooth rational splines that enables, in particular, exact descriptions of ellipses and ellipsoids - some of the most important primitives for CAD and CAE. The univariate rational splines…
This work introduces and analyzes B-spline approximation spaces defined on general geometric domains obtained through a mapping from a parameter domain. These spaces are constructed as sparse-grid tensor products of univariate spaces in the…
We study the flat geometry of the least degenerate singularity of a singular surface in $\mathbb R^4$, the $I_{1}$ singularity parametrised by $(x,y)\mapsto(x,xy,y^{2},y^{3})$. This singularity appears generically when projecting a regular…
This work deals with shape optimization of electric machines using isogeometric analysis. Isogeometric analysis is particularly well suited for shape optimization as it allows to easily modify the geometry without remeshing the domain. A…
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…
Functions which are covariant or invariant under the transformations of a compact linear group $G$ acting in a euclidean space $\real^n$, can be profitably studied as functions defined in the orbit space of the group. The orbit space is the…
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…
An Isogeometric Boundary Element Method (IgA-BEM) is considered for the numerical solution of Helmholtz problems on 3D bounded or unbounded domains, admitting a smooth conformal multi-patch representation of their finite boundary surface.…
Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric…
Recently, the authors have proposed and analyzed isogeometric tearing and interconnecting (IETI-DP) solvers for multi-patch discretizations in Isogeometric Analysis. Conforming and discontinuous Galerkin settings have been considered. In…
Interlocking interfaces are commonly employed to mitigate relative sliding under shear.Indeed, Their geometry is typically selected on grounds of fabrication convenience rather than analytical optimality. There is no reason to suppose that…
We introduce cosurfaces with values in the group \(\PC_n(H)\) of \(H\)-valued reciprocal pairwise comparison matrices. The composition law is covariant on upper triangular coefficients and contravariant on lower triangular coefficients,…
This paper discusses the dimensions of biquadratic C1 spline spaces and bicubic C2 spline spaces over hierarchical T-meshes using the smoothing cofactor-conformality method. We obtain the dimension formula of biquadratic C1 spline spaces…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
Alignment between non-rigid stretchable structures is one of the most challenging tasks in computer vision, as the invariant properties are hard to define, and there is no labeled data for real datasets. We present unsupervised neural…
Unfitted mesh formulations for interface problems generally adopt two distinct methodologies: (i) penalty-based approaches and (ii) explicit enrichment space techniques. While Stable Generalized Finite Element Method (SGFEM) has been…
We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…
A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set…
Volumetric parameterization problem refers to parameterization of both the interior and boundary of a 3D model. It is a much harder problem compared to surface parameterization where a parametric representation is worked out only for the…