Computing signed permutations of polygons

DOI10.1142/S0218195911003561MaRDI QIDQ3007725zbMATH OpenOpenAlexFDO

Authors Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Godfried Toussaint, Henk Meijer, Mark H. Overmars

Publication date 17 June 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195911003561

zbMATH Keywords

Computation geometryconvexificationgeometric permutationpolygonal reconfigurationrotational or mirror symmetry

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Flipturning Polygons
• Reconfiguring convex polygons
• Polygons needing many flipturns
• Convexification of polygons by length preserving transformations
• scientific article; zbMATH DE number 1522946

Cites work

• Convexification of polygons by flips and by flipturns
• scientific article; zbMATH DE number 3119672 (Why is no real title available?)
• Morphing simple polygons
• On a Family of Polygons
• On local transformation of polygons with visibility properties.
• Self-avoiding random loops
• Sorting a bridge hand
• Sorting by Transpositions
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions

This page was built for publication: Computing signed permutations of polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007725)