Measuring Concavity on a Rectangular Mosaic
IEEE Transactions on Computers
Finding the convex hull of a simple polygon
Pattern Recognition Letters
A historical note on convex hull finding algorithms
Pattern Recognition Letters
On the application of the convex hull to histogram analysis in threshold selection
Pattern Recognition Letters
Triangulating and guarding realistic polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.10 |
A two-stage algorithm was recently proposed by Sklansky (1982) for computing the convex hull of a simple polygon P. The first step is intended to compute a simple polygon P^* which is monotonic in both the x and y directions and which contains the convex hull vertices of P. The second step applies a very simple convex hull algorithm on P^*. In this note we show that the first step does not always work correctly and can even yield non-simple polygons, invalidating the use of the second step. It is also shown that the first step can discard convex hull vertices thus invalidating the use of any convex hull algorithm in the second step.