Discrete & Computational Geometry

, Volume 16, Issue 4, pp 361–368

Optimal output-sensitive convex hull algorithms in two and three dimensions

Authors

  • T. M. Chan
    • Department of Computer ScienceUniversity of British Columbia
Article

DOI: 10.1007/BF02712873

Cite this article as:
Chan, T.M. Discrete Comput Geom (1996) 16: 361. doi:10.1007/BF02712873
  • 584 Views

Abstract

We present simple output-sensitive algorithms that construct the convex hull of a set ofn points in two or three dimensions in worst-case optimalO (n logh) time andO (n) space, whereh denotes the number of vertices of the convex hull.

Download to read the full article text

Copyright information

© Springer-Verlag New York Inc 1996