Ghosh , S. K. (1984) A linear-time algorithm for determining the intersection type of two star polygons Lecture Notes in Computer Science, 181 . pp. 317-330. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/p7611784q463x6...
Related URL: http://dx.doi.org/10.1007/3-540-13883-8_80
Abstract
In this paper, we present a linear time algorithm for determining the intersection type of two star polygons and prove its correctness. The algorithm exploits the sorted angular order of the vertices of a star polygon and, thus, avoiding the general step of sorting the polygonal vertices.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| ID Code: | 76287 |
| Deposited On: | 31 Dec 2011 08:54 |
| Last Modified: | 31 Dec 2011 08:54 |
Repository Staff Only: item control page
