Computing the convex hull of a set of points

Abstract Title of program: CXHULL Catalogue number: AATI Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland (see application form in this issue) Computer: VAX 8600; Installation: Lockheed Palo Alto Research Labs. Operating system: VMS Version 4.2 Programming language used: Fortran 77 High speed storage required: 8123 words No. of bits in a word: 32 No. of lines in combined program and test deck: 669 Title of program: CXHULL Catalogue Id: AATI_v1_0 Nature of problem The program determines the vertices of the convex hull of a set of points in the (x,y) plane. The convex hull is the minimum area convex polygon which will entirely contain the set. The vertices are output in countrclockwise order beginning with the vertex which has least y- coordinate. Versions of this program held in the CPC repository in Mendeley Data AATI_v1_0; CXHULL; 10.1016/0010-4655(87)90055-5 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)

程序抽象标题：CXHULL
目录编号：AATI
程序获取渠道：北爱尔兰贝尔法斯特女王大学CPC程序库（详见本期申请表）
适用计算机：VAX 8600；部署机构：洛克希德·帕洛阿尔托研究实验室
操作系统：VMS 4.2版
所用编程语言：Fortran 77
所需高速存储空间：8123个存储字
单字位数：32位
程序与测试用例合并总行数：669行

程序名称：CXHULL
目录标识：AATI_v1_0
问题描述：本程序用于求解二维平面（x,y）内点集的凸包顶点。凸包指可完全包含该点集的最小面积凸多边形，程序将以逆时针顺序输出顶点，起始顶点为y坐标最小的点。

Mendeley数据中的CPC库留存的该程序版本：AATI_v1_0；CXHULL；DOI:10.1016/0010-4655(87)90055-5
本程序源自贝尔法斯特女王大学维护的CPC程序库（1969-2018年）