In-Place Planar Convex Hull Algorithms

@inproceedings{Brnnimann2002InPlacePC,
  title={In-Place Planar Convex Hull Algorithms},
  author={Herv{\'e} Br{\"o}nnimann and John Iacono and Jyrki Katajainen and Pat Morin and Jason Morrison and Godfried T. Toussaint},
  booktitle={LATIN},
  year={2002}
}
An in-place algorithm is one in which the output is given in the same location as the input and only a small amount of additional memory is used by the algorithm. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All three algorithms are optimal, some more so than others. . . 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

insitu.tgz. Available online at http://cgm.cs.mcgill.ca/~morin

  • P. Morin
  • 2001
2 Excerpts

Similar Papers

Loading similar papers…