## Parallel Image Analysis: Theory and Applications, Volume 1This volume deals with the following topics: 2-D, 3-D automata and grammars, parallel architecture for image processing, parallel digital geometry algorithms, data allocation strategies for parallel image processing algorithms, complexity analysis of parallel image operators. The contributions are written by leading experts in the fields of models, algorithms and architectures for parallel image processing. |

### Contents

Foreword | 1 |

Facilitating HighPerformance Image Analysis on Reduced Hypercube RH | 23 |

TimeOptimal Digital Geometry Algorithms on Meshes with Multiple | 43 |

A TimeOptimal MultipleQuery NearestNeighbor Algorithm on Meshes | 57 |

A Linear Algorithm for Segmentation of Digital Curves | 73 |

Some Notes on Parallel Coordination Grammars | 101 |

Basic Puzzle Languages | 111 |

Cooperating Systems of ThreeWay TwoDimensional Finite Automata | 125 |

The Effect of Inkdots for TwoDimensional Automata | 141 |

Thinning and Tracking | 161 |

### Common terms and phrases

3-d image accepting adjacent alternating Turing machines array automaton binary image binary tree boundary of q C-grammar candidate points cell columns component Computer Science configuration connected contains convex hull Corollary cosimple decomposition defined Definition deletion denote digital geometry distance transform edge elements finite automata hereditarily simple homotopy equivalence hypercube image analysis image processing implementation inkdot input tape integer iteration Lemma LRS1 LRS2 M₁ mapping mesh with multiple minimal non-simple set multiple broadcasting neighbors node non-cosimple non-empty nondeterministic parallel computers parallel coordinate parallel thinning algorithm pixels pixels or voxels prefix sum preserves topology problem processor Proof Proposition regular hypercube result RH's SB's segment sentential form sequence sequential set of 1's set of q simple 1's skeleton solution sub-domains sub-iteration subset surface graph symbol T-attachment set T₁ Takanami Theorem 4.1 three-way time-optimal Turing machines two-dimensional upper leaning point v₁ voxels WeiArray WN(p