Related papers: Slime mould computes planar shapes

Here we establish several results on the nonlocal curvature of planar curves. First we show how to express the nonlocal curvature of a curve relative to a point in terms of the nonlocal curvatures of simpler components of that curve…

One of the molecular properties most intuitive to the human perception is the geometrical shape. However, when exploring a large chemical space the determination of shape needs to be automated. We present a fast and simple approach to…

The "cosmic web", the filamentary large-scale structure in a cold dark matter Universe, is readily apparent via galaxy tracers in spectroscopic surveys. However, the underlying dark matter structure is as of yet unobservable and mapping the…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

We propose a novel way of computing surface folding maps via solving a linear PDE. This framework is a generalization to the existing quasiconformal methods and allows manipulation of the geometry of folding. Moreover, the crucial quantity…

We focus on the analysis of planar shapes and solid objects having thin features and propose a new mathematical model to characterize them. Based on our model, that we call an epsilon-shape, we show how thin parts can be effectively and…

The moduli space of planar polygons with generic side lengths is a closed, smooth manifold. Mapping a polygon to its reflected image across the $X$-axis defines a fixed-point-free involution on these moduli spaces, making them into free…

Reconstructing a composition (union) of convex polytopes that perfectly fits the corresponding input point-cloud is a hard optimization problem with interesting applications in reverse engineering and rigid body dynamics simulations. We…

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

Modern geometric measure theory, developed largely to solve the Plateau problem, has generated a great deal of technical machinery which is unfortunately regarded as inaccessible by outsiders. Some of its tools (e.g., flat norm distance and…

Let $P$ be a crossing-free polygon and $\mathcal C$ a set of shortcuts, where each shortcut is a directed straight-line segment connecting two vertices of $P$. A shortcut hull of $P$ is another crossing-free polygon that encloses $P$ and…

Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…

This survey gives an overview of several fundamental algebraic constructions which arise in the study of splines. Splines play a key role in approximation theory, geometric modeling, and numerical analysis, their properties depend on…

A Trace-Finite-Cell-Method for the numerical analysis of thin shells is presented combining concepts of the TraceFEM and the Finite-Cell-Method. As an underlying shell model we use the Koiter model, which we re-derive in strong form based…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…

An orbit polytope is the convex hull of an orbit under a finite group $G \leq \operatorname{GL}(d,\mathbb{R})$. We develop a general theory of possible affine symmetry groups of orbit polytopes. For every group, we define an open and dense…

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Let $P$ be a planar set of $n$ points in general position. We consider the problem of computing an orientation of the plane for which the Rectilinear Convex Hull of $P$ has minimum area. Bae et al. (Computational Geometry: Theory and…