hide
Free keywords:
-
Abstract:
We present C{\tt ++}-implementations of some classical algorithms for
computing
extreme points of a set of points in two-dimensional space.
The template feature of C{\tt ++} is used to provide generic code, that
works with various point types and various implementations of the primitives
used in the extreme point computation. The parameterization makes the code
flexible and adaptable. The code can be used with primitives provided by the
CGAL-kernel,
primitives provided by LEDA, and others. The interfaces of the convex
hull functions are compliant to the Standard Template Library.