Two output-sensitive procedures for identifying the extreme points (the "frame") of the convex hull of a finite point set have appeared in the literature: one by Dulá and Helgason (1996)  and the other by Ottmann et al. (2001) . The two procedures are in dual spaces and differ enough to motivate the question as to how they compare in a fair competition. We derive an improved dualized version of the procedure in Ottmann et al. (2001)  and compare it to the one in Dulá and Helgason (1996)  using a well-structured, large-scale, problem suite. © 2011 Elsevier B.V. All rights reserved.
Dulá, J. H., & López, F. J. (2012). Competing output-sensitive frame algorithms. Computational Geometry: Theory and Applications, 45(4), 186–197. https://doi.org/10.1016/j.comgeo.2011.12.006