Abstract
An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.
Original language | English (US) |
---|---|
Pages (from-to) | 140-144 |
Number of pages | 5 |
Journal | Image and Vision Computing |
Volume | 1 |
Issue number | 3 |
DOIs | |
State | Published - Aug 1983 |
Keywords
- algorithm
- computational geometry
- convex hull
- expected complexity
ASJC Scopus subject areas
- Signal Processing
- Computer Vision and Pattern Recognition