Related papers: Ipelets for the Convex Polygonal Geometry
We present a high order immersed finite element (IFE) method for solving the elliptic interface problem with interface-independent meshes. The IFE functions developed here satisfy the interface conditions exactly and they have optimal…
Since the 1960's the finite element method emerged as a powerful tool for the numerical simulation of countless physical phenomena or processes in applied sciences. One of the reasons for this undeniable success is the great versatility of…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
A fundamental task in data exploration is to extract simplified low dimensional representations that capture intrinsic geometry in data, especially for faithfully visualizing data in two or three dimensions. Common approaches to this task…
Mathematical educational soft explore, investigating in a dynamical way, some algebraically, geometrically problems, the expected results being used to involve a lot of mathematical results. One such software soft is GeoGebra. The software…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…
This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are…
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
The aim of this paper is to apply an extrapolation result without relying on convexification. We characterize ball Banach function spaces in terms of wavelets, formulated in a way that takes into account the smoothness properties of the…
This paper presents a new mesh segmentation method that integrates geometrical and topological features through a flexible Reeb graph representation. The algorithm consists of three phases: construction of the Reeb graph using the improved…
Shape analysis and compuational anatomy both make use of sophisticated tools from infinite-dimensional differential manifolds and Riemannian geometry on spaces of functions. While comprehensive references for the mathematical foundations…
In this study, the properties of convex hexagons that can form rotationally symmetric edge-to-edge tilings are discussed. Because the convex hexagons are equilateral convex parallelohexagons, convex pentagons generated by bisecting the…
In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA$(n,m)$, where $n$ is the number of factors and $m$ the force, to the solution of an Integer Programming…
We present Deformable Voxel Grids (DVGs) for 3D shapes comparison and processing. It consists of a voxel grid which is deformed to approximate the silhouette of a shape, via energy-minimization. By interpreting the DVG as a local…