MPI-I-98-1-003. January 1998, 93 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
1664 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |