Date of this Version
Computational geometry is, in brief, the study of algorithms for geometric problems. Classical study of geometry and geometric objects, however, is not well-suited to efficient algorithms techniques. Thus, for the given geometric problems, it becomes necessary to identify properties and concepts that lend themselves to efficient computation. The primary focus of this paper will be on one such geometric problems, the Convex Hull problem.
Suneeta Ramaswami, "Convex Hulls: Complexity and Applications (a Survey)", . December 1993.
Date Posted: 16 July 2007