Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
Geometric modeling of solid objects by using a face adjacency graph representation
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Curve and Surface Reconstruction in R2 and R3
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
A 3D Convex Hull algorithm for modelling medical data in a virtual environment
International Journal of Intelligent Systems Technologies and Applications
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Computer Graphics Forum
| Hi-index | 0.00 |
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.