Ghosh, S. K. ; Shyamasundar, R. K. (1983) A linear time algorithm for obtaining the convex hull of a simple polygon Pattern Recognition, 16 (6). pp. 587-592. ISSN 0031-3203
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/0...
Related URL: http://dx.doi.org/10.1016/0031-3203(83)90075-4
Abstract
In this paper, a linear time algorithm is described for finding the convex hull of a simple (i.e. non-self intersecting) polygon.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Convex Hull Algorithm; Computational Complexity; Simple Polygon; Convex Polygon; Ordered Crossing Polygon |
| ID Code: | 76269 |
| Deposited On: | 31 Dec 2011 08:54 |
| Last Modified: | 31 Dec 2011 08:54 |
Repository Staff Only: item control page
