超立方体计算机上的平面凸壳算法

A planar convex hull algorithm on a hypercube computer

给出了在起立方体结构的计算机上，求平面点集的凸壳的一个算法，并分析了算法的正确性和时间复杂性．

This paper presents an algorithm for determining the convex hull of a set of points in a plane on a hypercube computer, and analyses its correctness and time complexity.