A comparison of five implementations of 3D Delaunay tessellation When implementing Delaunay tessellation in 3D, a number of engineering decisions must be made about update and location algorithms, arithmetics, perturbations, and representations. We compare five codes for computing 3D Delaunay tessellation: qhull, hull, CGAL, pyramid, and our own tess3, and explore experimentally how these decisions affect the correctness and speed of computation, particularly for input points that represent atoms coordinates in proteins.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.
- Liu, Yuanxin; Snoeyink, Jack: A comparison of five implementations of 3D Delaunay tessellation (2005)