Computational geometry: an introduction
Computational geometry: an introduction
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Optimal Parallel Algorithms for Finding Proximate Points, with Applications
IEEE Transactions on Parallel and Distributed Systems
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Computational Geometry in C
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
On the shape of a set of points in the plane
IEEE Transactions on Information Theory
Computation of the travelling salesman problem by a shrinking blob
Natural Computing: an international journal
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
Computing a polygon defining a set of planar points is a classical problem of modern computational geometry. In laboratory experiments, we demonstrate that a concave hull, a connected α-shape without holes, of a finite planar set is approximated by slime mould Physarum polycephalum. We represent planar points with sources of long-distance attractants and short-distance repellents and inoculate a piece of plasmodium outside the dataset. The plasmodium moves towards the data and envelops it by pronounced protoplasmic tubes.