Computing Signed Permutations of Polygon
Given a planar polygon (or chain) with a list of edges {e[subscript 1], e[subscript 2], e[subscript 3], ..., e[subscript n-1], e[subscript n]}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider a...
| Main Authors: | , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
World Scientific,
2012-10-15T16:31:23Z.
|
| Subjects: | |
| Online Access: | Get fulltext |