.png){kind=icon}
返回
An efficient algorithm for the largest empty figure problem based on a 2D cellular automaton architecture
.png){kind=icon}
PRE
AI
DOI：10.1016/S0262-8856(96)01111-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
voronoi diagram
cellular automata
VLSI
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
暂无机构信息
引用论文
分享收藏Parent artery-initiated and stent-mediated neointima formation in a rat saccular side wall model
OAAI
OAAI分享收藏Demembranated muscle fibers catalyze a more rapid exchange between phosphate and adenosine triphosphate than actomyosin subfragment脱膜的肌纤维比肌动球蛋白亚片段催化磷酸和三磷酸腺苷之间的交换更快.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏 没有更多内容
没有更多内容