Ghosh, S. K. ; Shyamasundar, R. K. (1984) A linear time algorithm for computing the convex hull of an ordered crossing polygon Pattern Recognition, 17 (3). pp. 351-358. 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(84)90086-4
Abstract
In this paper, we describe a linear time algorithm for finding the convex hull of an ordered crossing polygon and prove its correctness.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Convex Hull; Simple Polygon; Crossing Polygon; Ordered Crossing Polygon |
| ID Code: | 76270 |
| Deposited On: | 31 Dec 2011 08:54 |
| Last Modified: | 31 Dec 2011 08:54 |
Repository Staff Only: item control page
