Related papers: Slime mould computes planar shapes

This article discusses the problem of determining whether a given point, or set of points, lies within the convex hull of another set of points in $d$ dimensions. This problem arises naturally in a statistical context when using a…

We study the following range searching problem: Preprocess a set $P$ of $n$ points in the plane with respect to a set $\mathcal{O}$ of $k$ orientations % , for a constant, in the plane so that given an $\mathcal{O}$-oriented convex polygon…

Using the Surface Evolver software, we perform numerical simulations of point-like deformations in a two-dimensional foam. We study perturbations which are infinitesimal or finite, isotropic or anisotropic, and we either conserve or do not…

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…

The complex projective structures considered is this article are compact curves locally modeled on $\mathbb{CP}^1$. To such a geometric object, modulo marked isomorphism, the monodromy map associates an algebraic one: a representation of…

This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…

We describe a quantitative construction of almost-normal diffeomorphisms between embedded orientable manifolds with boundary to be used in the study of geometric variational problems with stratified singular sets. We then apply this…

We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…

This paper presents Polylidar, an efficient algorithm to extract non-convex polygons from 2D point sets, including interior holes. Plane segmented point clouds can be input into Polylidar to extract their polygonal counterpart, thereby…

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…

We propose Polyra Swarms, a novel machine-learning approach that approximates shapes instead of functions. Our method enables general-purpose learning with very low bias. In particular, we show that depending on the task, Polyra Swarms can…

A computational fluid model is developed to study waves and instabilities. A new technique involving initial perturbations in configuration space have been implemented to excite the plasma waves; i.e. the perturbations acting similar to a…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

We study a phenomenological model in which the simulated packing of hard, attractive spheres on a prolate spheroid surface with convexity constraints produces structures identical to those of prolate virus capsid structures. Our simulation…

We give a general procedure for gluing together possibly noncompact manifolds of constant scalar curvature which satisfy an extra nondegeneracy hypothesis. Our aim is to provide a simple paradigm for making `analytic' connected sums. In…

We introduce and analyse a new nonparametric estimator of a multi-dimensional density. Our smooth projection estimator (SPE) is defined by a least squares projection of the sample onto an infinite dimensional mixture class via an…

This paper investigates the transformation of a convex hull, derived from a d-dimensional point cloud, into a concave surface. Our primary focus is on the development of a methodology that ensures all points in the point cloud are…

We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…