Competing output-sensitive frame algorithms

  • Authors:

  • J. H. Dulá;F. J. López

  • Affiliations:

  • Virginia Commonwealth University, Snead Hall, 301 W. Main Street, P.O. Box 844000, Richmond, VA 23284-4000, USA;Macon State College, 100 College Station Dr., Macon, GA 31206, USA

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 Dula and Helgason (1996) [10] and the other by Ottmann et al. (2001) [27]. 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) [27] and compare it to the one in Dula and Helgason (1996) [10] using a well-structured, large-scale, problem suite.