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

Full description

Bibliographic Details
Main Authors: Aloupis, Greg, Bose, Prosenjit, Demaine, Erik D., Langerman, Stefan, Meijer, Henk, Overmars, Mark, Toussaint, Godfried T.
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: World Scientific 2012
Online Access:http://hdl.handle.net/1721.1/73973
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/73973
https://orcid.org/0000-0003-3803-5703

Similar Items