Computing Signed Permutations of Polygon

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...

Full description

Bibliographic Details
Main Authors: Aloupis, Greg (Author), Bose, Prosenjit (Author), Demaine, Erik D. (Contributor), Langerman, Stefan (Author), Meijer, Henk (Author), Overmars, Mark (Author), Toussaint, Godfried T. (Author)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: World Scientific, 2012-10-15T16:31:23Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items