The implementation of an algorithm to find the convex hull of a set of three-dimensional points

Day, A. M. (1990) The implementation of an algorithm to find the convex hull of a set of three-dimensional points. ACM Transactions on Graphics, 9 (1). pp. 105-132. ISSN 0730-0301

Full text not available from this repository. (Request a copy)

Abstract

A detailed description of the implementation of a three-dimensional convex hull algorithm is given. The problems experienced in the production and testing of a correct and robust implementation of a geometric algorithm are discussed. Attention is paid to those issues that are often brushed over in the theoretical descriptions but cause errors in a real computation. These include degeneracies such as coplanar points, floating-point errors, and other special, but not necessarily degenerate, cases.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Computer Graphics (former - to 2018) Faculty of Science > Research Groups > Visual Computing and Signal Processing
Depositing User:	Vishal Gautam
Date Deposited:	08 Mar 2011 10:53
Last Modified:	28 Mar 2025 05:08
URI:	https://ueaeprints.uea.ac.uk/id/eprint/22292
DOI:	10.1145/77635.77640

Actions (login required)

View Item