Parameterized implementations of classical planar convex hull algorithms and 
extreme point compuations

Schirra, Stefan

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

Parameterized implementations of classical planar convex hull algorithms and extreme point compuations

MPS-Authors

/persons/resource/persons45391

Schirra, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

MPI-I-98-1-003.pdf
(Any fulltext), 501KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Schirra, S.(1998). Parameterized implementations of classical planar convex hull algorithms and extreme point compuations (MPI-I-1998-1-003). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-7BEB-2

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.