Skip Navigation

The Computer Journal 1979 22(3):262-266; doi:10.1093/comjnl/22.3.262
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (26)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Green, P. J.
Right arrow Articles by Silverman, B. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Constructing the convex hull of a set of points in the plane

P. J. Green1 * and B. W. Silverman2 §

1 Department of Mathematics, University of Durham, South Road, Durham, UK, 2 School of Mathmatics, University of Bath, Calverton Down, Bath, UK

A highly efficient algorithm for computing the vertices of the convex hull of a set of points in the plane is described and compared with existing methods. Empirical timings of a FORTRAN implementation of the algorithm show it to be faster than previous methods for most configurations of points. Careful consideration is given throughout to ensure that degenerate configurations, containing collinear or near-collinear points, are handled correctly.

Received June 1978.

* University of Bath: now at Department of Mathematics, University of Durham, South Road, Durham, DH1 3LE

§ University of Oxford: now at School of Mathmatics, University of Bath, Calverton Down, Bath, BA2 7AY


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.