Computational geometry: an introduction
Computational geometry: an introduction
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
A lower bound to finding convex hulls
A lower bound to finding convex hulls
Real time dynamic fracture with volumetric approximate convex decompositions
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.00 |
The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Ω(N log N). In this paper, we describe an algorithm with time complexity O(N + k2), where k is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of an exact solution. A formula for upper bound of the approximation error is presented.