Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Comment on Melkman's Convex Hull Algorithm

Published

Author(s)

David S. Bright

Abstract

The input to the elegant and simple algorithm by Melkman must not be three collinear points. Otherwise, the algorithm correctly removes collinear points.
Citation
Elsevier Science, The Netherlands

Keywords

analysis of algorithms, collinear data, convex hull

Citation

Bright, D. (2008), Comment on Melkman's Convex Hull Algorithm, Elsevier Science, The Netherlands (Accessed October 8, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created October 16, 2008
Was this page helpful?