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

255Citations
Citations of this article
124Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present simple output-sensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worst-case optimal O(n log h) time and O(n) space, where h denotes the number of vertices of the convex hull.

Cite

CITATION STYLE

APA

Chan, T. M. (1996). Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete and Computational Geometry, 16(4), 361–368. https://doi.org/10.1007/BF02712873

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free