✦ LIBER ✦

Chemical Processor for Computation of Skeleton of Planar Shape

✍ Scribed by Andrew Adamatzky; Dmitrii Tolmachiev

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 264 KB
Volume: 7
Category: Article
ISSN: 1616-301X
DOI: 10.1002/(sici)1099-0712(199705)7:3<135::aid-amo302>3.0.co;2-v

No coin nor oath required. For personal study only.

✦ Synopsis

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 model and a real prototype of a chemical processor that implement skeleton transformations. In the cellular automaton, segments of the discrete skeleton are computed via interactions of excitation waves, while in the chemical processor the underlying mechanism is the formation of Prussian blue in an agar gel film. *

📜 SIMILAR VOLUMES

Chemical processor for computation of vo

Chemical processor for computation of voronoi diagram

✍ Dmitrii Tolmachiev; Andrew Adamatzky 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 499 KB

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 a

Computing the shape of a planar points s

Computing the shape of a planar points set

✍ Mahmoud Melkemi; Mourad Djebali 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 701 KB

In this article, we introduce a mathematical formalism de"ning the shape of a "nite point set which we call A-shape. The parameter A is a "nite set of points which positions variation allows A-shape to generate a family of graphs extracted from Delaunay triangulation. Each graph corresponds to an el

Accelerated computation of admittance pa

Accelerated computation of admittance parameters for planar waveguide junctions

✍ Boria, Vicente E. ;Guglielmi, Marco 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 320 KB

The design and implementation of a recon

The design and implementation of a reconfigurable processor for problems of combinatorial computation

✍ Iouliia Skliarova; António B. Ferrari 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Convergence and Continuity Criteria for

Convergence and Continuity Criteria for Discrete Approximations of the Continuous Planar Skeleton

✍ J.W. Brandt 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 716 KB

It has been proposed recently that the skeleton of a shape can be computed using the Voronoi diagram of a discrete sample set of the shape boundary. This method avoids many of the complications encountered when computing the skeleton directly from an image because it is based on a continuous-domain

Faster computation of Z-matrices for tri

Faster computation of Z-matrices for triangular segments in planar circuits

✍ Lee, Sung Hwan ;Benalla, A. ;Gupta, K. C. 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 580 KB

## Abstract The method of images and currently available single‐series formulation of a rectangular planar segment have been applied to speed up the computations of impedance matrix elements of 30°–60°–90° and equilateral triangular microstrip segments used in planar microwave circuits. For an equi