𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chemical processor for computation of voronoi diagram

✍ Scribed by Dmitrii Tolmachiev; Andrew Adamatzky

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
499 KB
Volume
6
Category
Article
ISSN
1616-301X

No coin nor oath required. For personal study only.

✦ Synopsis

In the paper we show how to approximate the Voronoi diagram of a finite set of planar points in a chemical processor consisting of an agar-palladium thin layer and potassium iodide liquid diffusing on it. The configuration of a given point set is represented by the spatial distribution of KI drops and the bisectors of the required Voronoi diagram are computed according to the KEYWORDS molecular computers: computational geometry; cellular automata PdCI, + 2KI = Pdl,& + 2KCI.

πŸ“œ SIMILAR VOLUMES

Chemical Processor for Computation of Sk
Chemical Processor for Computation of Skeleton of Planar Shape
✍ Andrew Adamatzky; Dmitrii Tolmachiev πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 264 KB

In this paper we give a regular proof of the viability of the theory of reaction-diffusion computing. The test problem is to approximate the skeleton of a planar contour, i.e. select sites of centres of bitangent circles which lie wholly within the contour. We have designed both a cellular automaton

Euclidean Voronoi diagram of 3D balls an
Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
✍ Deok-Soo Kim; Youngsong Cho; Donguk Kim πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 436 KB

Despite its important applications in various disciplines in science and engineering, the Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclid

A sweepline algorithm for Euclidean Voro
A sweepline algorithm for Euclidean Voronoi diagram of circles
✍ Li Jin; Donguk Kim; Lisen Mu; Deok-Soo Kim; Shi-Min Hu πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 647 KB

Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative and not necessarily equal. It is allowed that circles intersect each other, and a circle contains others. The proposed