Related papers: Construction of analysis-suitable $G^1$ planar mul…
The analysis of electromagnetic scattering has long been performed on a discrete representation of the geometry. This representation is typically continuous but {\em not} differentiable. The need to define physical quantities on this…
Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal{A}$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal{A}$ is a planar polyline drawing $\Gamma$ of $G$…
An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…
The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…
We prove that a planar $C^2$-regular boundary $\Gamma$ can always be parameterized with its closest point projection $\pi$ over a certain collection of edges $\Gamma_h$ in an ambient triangulation, by making simple assumptions on the…
We present a novel method for solving high-order partial differential equations (PDEs) over planar multi-patch geometries demonstrated on the basis of the polyharmonic equation of order $m$, $m \geq 1$, which is a particular linear elliptic…
The I-patch is a multi-sided surface representation, defined as a combination of implicit ribbon and bounding surfaces, whose pairwise intersections determine the natural boundaries of the patch. Our goal is to show how a collection of…
The Laplace eigenvalue problem on circular sectors has eigenfunctions with corner singularities. Standard methods may produce suboptimal approximation results. To address this issue, a novel numerical algorithm that enhances standard…
Topology optimization is a valuable tool in engineering, facilitating the design of optimized structures. However, topological changes often require a remeshing step, which can become challenging. In this work, we propose an isogeometric…
The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…
Establishing accurate point-to-point correspondences between non-rigid 3D shapes remains a critical challenge, particularly under non-isometric deformations and topological noise. Existing functional map pipelines suffer from ambiguities…
One of the important aspects of IsoGeometric Analysis (IGA) is the strong link between Computer Aided Design and analysis. Two of IGA'a major challenge are the assembly of patches (Constructive Solid Geometry geometries made of Boolean…
Isogeometric Analysis (IgA) is a versatile method for the discretization of partial differential equations on complex domains, which arise in various applications of science and engineering. Some complex geometries can be better described…
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…
In this paper we develop an isogeometric B\'ezier dual mortar method for the biharmonic problem on multi-patch domains. The well-posedness of the discrete biharmonic problem requires a discretization with $C^1$ continuous basis functions.…
The matrix formation associated to high-order discretizations is known to be numerically demanding. Based on the existing procedure of interpolation and lookup, we design a multiscale assembly procedure to reduce the exorbitant assembly…
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…
Subdivision surfaces provide an elegant isogeometric analysis framework for geometric design and analysis of partial differential equations defined on surfaces. They are already a standard in high-end computer animation and graphics and are…
Criteria for approximability of functions by solutions of homogeneous second order elliptic equations (with constant complex coefficients) in the norms of the Whitney $C^1$-spaces on compact sets in $\mathbb R^2$ are obtained in terms of…
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a…