Related papers: Constructing IGA-suitable planar parameterization …
Geodesic models are known as an efficient tool for solving various image segmentation problems. Most of existing approaches only exploit local pointwise image features to track geodesic paths for delineating the objective boundaries.…
In this work we apply reduced basis methods for parametric PDEs to an isogeometric formulation based on NURBS. The motivation for this work is an integrated and complete work pipeline from CAD to parametrization of domain geometry, then…
We describe a new approach to the problem of constructing gluing parameterizations for open neighborhoods of boundary points of moduli spaces of anti-self-dual connections over closed four-dimensional manifolds. Our approach employs general…
Growing heterogeneity and configurability in HPC architectures has made auto-tuning applications and runtime parameters on these systems very complex. Users are presented with a multitude of options to configure parameters. In addition to…
We study approximation error bounds of isogeometric function spaces on a specific type of singularly parameterized domains. In this context an isogeometric function is the composition of a piecewise rational function with the inverse of a…
In this paper, we propose a Boundary-aware Graph Reasoning (BGR) module to learn long-range contextual features for semantic segmentation. Rather than directly construct the graph based on the backbone features, our BGR module explores a…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
Finding optimal parameter configurations for tunable GPU kernels is a non-trivial exercise for large search spaces, even when automated. This poses an optimization task on a non-convex search space, using an expensive to evaluate function…
Excellent performance has been achieved on instance segmentation but the quality on the boundary area remains unsatisfactory, which leads to a rising attention on boundary refinement. For practical use, an ideal post-processing refinement…
We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this…
The notion of a (polynomial) kernelization from parameterized complexity is a well-studied model for efficient preprocessing for hard computational problems. By now, it is quite well understood which parameterized problems do or…
The isogeometric formulation of Boundary Element Method (BEM) is investigated within the adaptivity framework. Suitable weighted quadrature rules to evaluate integrals appearing in the Galerkin BEM formulation of 2D Laplace model problems…
As a parametric polynomial curve family, B\'ezier curves are widely used in safe and smooth motion design of intelligent robotic systems from flying drones to autonomous vehicles to robotic manipulators. In such motion planning settings,…
Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of…
This paper introduces a novel adaptive refinement strategy for Isogeometric Analysis (IGA) using Truncated Hierarchical B-splines (THB-splines). The proposed strategy enhances locally-refined meshes for specific applications, simplifying…
We study the space of $C^1$ isogeometric spline functions defined on trilinearly parameterized multi-patch volumes. Amongst others, we present a general framework for the design of the $C^1$ isogeometric spline space and of an associated…
Continuous formulations of trajectory planning problems have two main benefits. First, constraints are guaranteed to be satisfied at all times. Secondly, dynamic obstacles can be naturally considered with time. This paper introduces a novel…
In this paper, we study FPGA based pipelined and superscalar design of two variants of conjugate gradient methods for solving Laplacian equation on a discrete grid; the first version corresponds to the original conjugate gradient algorithm,…
We propose a new algorithm for curve skeleton computation which differs from previous algorithms by being based on the notion of local separators. The main benefits of this approach are that it is able to capture relatively fine details and…
In this paper we introduce a $C^1$ spline space over mixed meshes composed of triangles and quadrilaterals, suitable for FEM-based or isogeometric analysis. In this context, a mesh is considered to be a partition of a planar polygonal…