Research Initiation: VLSI Array System for Computational Geometry

用于解决计算几何问题的二维VLSI处理器阵列的设计和分析正在进行中。计算几何致力于寻找有效的算法解来计算几何性质，如一组多维点的凸壳和一组几何对象的各种距离或相交性质。这项研究的目标是将计算几何中的算法最佳地映射到二维VLSI处理器阵列中。虽然存在有效的顺序算法，但它们不适用于实时问题。当前的VLSI技术为实时应用提供了实现快速并行算法的工具。这项研究将我们目前关于映射算法的知识扩展到VLSI处理器阵列，这些处理器阵列主要基于线性递归。首席研究员是一名新博士，他的研究已经取得了重大进展。研究集中在重要而及时的主题上。强烈建议您提供支持。

The design and analysis of two-dimensional VLSI processor arrays to solve problems in computational geometry are being carried out. Computational geometry is concerned with finding efficient algorithmic solutions for computing geometric properties, such as the convex hull of a set of multidimensional points and various distance or intersection properties of a set of geometric objects. The goal of this research is to optimally map algorithms in computational geometry into two-dimensional VLSI processor arrays. Although efficient sequential algorithms exist, they are not suitable in real-time problems. The current VLSI technology provides a tool for implementing fast parallel algorithms for real-time applications. This research extends our current knowledge on mapping algorithms into VLSI processor arrays, which are mainly based on linear recurrences. The principal investigator is a new Ph.D. who already has significant progress in his research. The research focuses on important and timely topics. Support is highly recommended.