Related papers: Slime mould computes planar shapes
In this dissertation, we concentrate on the challenging research issue of developing a spline-based modeling framework, which converts the conventional data (e.g., surface meshes) to tensor-product trivariate splines. This methodology can…
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our…
We propose a new algorithm for approximating the metric projection onto a superelliptic disk of order $p>1$, i.e., the convex hull of a superellipse (Lam\'e curve), and prove its convergence.
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…
In this article, a new solution for the convex hull problem has been presented. The convex hull is a widely known problem in computational geometry. As nature is a rich source of ideas in the field of algorithms, the solution has been…
We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…
An overview over the current status of modeling galaxies by means of numerical simulations is given. After a short description of how galaxies form in hierarchically clustering scenarios, success and failures of current simulations are…
For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…
The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…
We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…
There is a growing interest towards implementation of maze solving in spatially-extended physical, chemical and living systems. Several reports of prototypes attracted great publicity, e.g. maze solving with slime mould and epithelial…
We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex…
We present new iterative algorithms for solving a square linear system $Ax=b$ in dimension $n$ by employing the {\it Triangle Algorithm} \cite{kal12}, a fully polynomial-time approximation scheme for testing if the convex hull of a finite…
We estimate the distribution of intrinsic shapes of the APM galaxy clusters from their corresponding distribution of projected shapes. We smooth the discrete galaxy distribution and define the cluster shape by fitting the best ellipse to…
On a finite-dimensional real vector space, we give a microlocal characterization of (derived) piecewise linear sheaves (PL sheaves) and prove that the triangulated category of such sheaves is generated by sheaves associated with convex…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…
The design of complex materials and the formation of specific patterns often arise from the properties of the individual building blocks. In this respect, colloidal systems offer a unique opportunity because nowadays they can be synthesized…