We report on experimental studies regarding the cost of exact and approximate convex hull computation in the plane in order to find out how much time you can save by the transition to approximations. Our experiments let us arrive at the conclusion that in most cases adaptive exact computation based on double expansions as introduced to computational geometry by Shewchuk [13] is as fast as stable computation of approximate hulls as described by Jaromczyk and Wasilkowski [7].
['Jan Tusch', 'Stefan Schirra']
Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane.