Bhattacharya, Binay Kumar ; Ghoshb, Subir Kumar ; Shermer, Thomas Caton (2006) A linear time algorithm to remove winding of a simple polygon Computational Geometry, 33 (3). pp. 165-173. ISSN 0925-7721
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1016/j.comgeo.2005.05.001
Abstract
In this paper, we present a linear time algorithm to remove winding of a simple polygon P with respect to a given point q inside P. The algorithm removes winding by locating a subset of Jordan sequence that is in the proper order and uses only one stack.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| Keywords: | Algorithm; Pruning; Revolution; Visibility Polygon; Winding |
| ID Code: | 76282 |
| Deposited On: | 31 Dec 2011 08:57 |
| Last Modified: | 31 Dec 2011 08:57 |
Repository Staff Only: item control page
