Affiliation:
1. Univ. of East Anglia, Norwich, UK
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Reference9 articles.
1. Geometric modeling of solid objects by using a face adjacency graph representation
2. BRAID I. Notes on a geometric modeller. C.A.D. Group Doc. 101 Univ. of Cambridge U.K. June 1979. BRAID I. Notes on a geometric modeller. C.A.D. Group Doc. 101 Univ. of Cambridge U.K. June 1979.
3. DAY A.M. The implementation of an algorithm to find the convex hull of a three dimensional set of points. Memo CGP 87/5 Dept. of Computing Science Univ. of East Anglia Norwich U.K. 1987. DAY A.M. The implementation of an algorithm to find the convex hull of a three dimensional set of points. Memo CGP 87/5 Dept. of Computing Science Univ. of East Anglia Norwich U.K. 1987.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献