| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415906 | Computational Geometry | 2006 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
