An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture

Abstract An efficient algorithm for determination of the largest empty figure that can be placed between a set of sites on a plane and its VLSI implementation are presented in this paper. The proposed algorithm is based on the Voronoi diagram in the ϱ1 metric which is established through the time evolution of 2-Dimensional Cellular Automata. The proposed algorithm is fast and efficient, and the 2-Dimensional Cellular Automaton architecture presented in this paper achieves a high frequency of operation. A Von-Neumann neighbourhood processor was implemented on a single VLSI chip using a 1.2 μm Double Layer Metal CMOS technology.

[1]  Howard C. Card,et al.  Group Properties of Cellular Automata and VLSI Applications , 1986, IEEE Transactions on Computers.

[2]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[3]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4]  Panagiotis Tzionas,et al.  A Parallel Skeletonization Algorithm Based on Two-Dimensional Cellular Automata and its VLSI Implementation , 1995, Real Time Imaging.

[5]  Bernard Chazelle,et al.  Computing the Largest Empty Rectangle , 1986, SIAM J. Comput..

[6]  Joseph R. Cavallaro,et al.  Numerical Accuracy and Hardware Tradeoffs for CORDIC Arithmetic for Special-Purpose Processors , 1993, IEEE Trans. Computers.

[7]  Robert L. Scot Drysdale,et al.  Voronoi diagrams based on convex distance functions , 1985, SCG '85.

[8]  Thomas P. Yunck,et al.  A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Kazuo Murota,et al.  A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing , 1984, Inf. Process. Lett..

[10]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[11]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[12]  Alok Aggarwal,et al.  Fast algorithms for computing the largest empty rectangle , 1987, SCG '87.

[13]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[14]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[15]  Derick Wood,et al.  Voronoi Diagrams Based on General Metrics in the Plane , 1988, STACS.

[16]  Igor Aleksander,et al.  Automata theory : an engineering approach , 1975 .

[17]  S. Wolfram,et al.  Two-dimensional cellular automata , 1985 .