Related papers: Slime mould computes planar shapes
We give an overview of the 2020 Computational Geometry Challenge, which targeted the problem of partitioning the convex hull of a given planar point set P into the smallest number of convex faces, such that no point of P is contained in the…
By evaporating a drop of lipid dispersion we generate the myelin morphology often seen in dissolving surfactant powders. We explain these puzzling nonequilibrium structures using a geometric argument: The bilayer repeat spacing increases…
A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in…
A spectrahedron is a set defined by a linear matrix inequality. A projection of a spectrahedron is often called a semidefinitely representable set. We show that the convex hull of a finite union of such projections is again a projection of…
A brief review is presented of the scaling of complex fluids, polymers and polyelectrolytes in solution and in confined geometry, in thermodynamical, structural and rheology properties using equilibrium and nonequilibrium dissipative…
Particle simulations confined by sharp walls usually develop an oscillatory density profile. For some applications, most notably soft matter liquids, this behavior is often unrealistic and one expects a monotonic density climb instead. To…
In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
We revisit the geometric foundations of mesh representation through the lens of Plane-based Geometric Algebra (PGA), questioning its efficiency and expressiveness for discrete geometry. We find how $k$-simplices (vertices, edges, faces,…
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
Statistical shape modeling is the computational process of discovering significant shape parameters from segmented anatomies captured by medical images (such as MRI and CT scans), which can fully describe subject-specific anatomy in the…
In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study,…
The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
When representing a solid object there are alternatives to the use of traditional explicit (surface meshes) or implicit (zero crossing of implicit functions) methods. Skeletal representations encode shape information in a mixed fashion:…
A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over…