logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

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

delete1997-01-01
delete4
PRE
AI
P
Panagiotis Tzionas *
A
A. Thanailakis
DOI：10.1016/S0262-8856(96)01111-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 rho 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 mu m Double Layer Metal CMOS technology.
Keywords:
voronoi diagram
cellular automata
VLSI
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Image and Vision Computing cover
Image and Vision Computing
IF:
4.2
Papers:
4.0K
Citations:
6.7K

Organization

No organization information available