COMPUTING SIGNED PERMUTATIONS OF POLYGONS

DOI10.1142/S0218195911003561zbMath1221.65051OpenAlexW2103472130MaRDI QIDQ3007725

Erik D. Demaine, Prosenjit Bose, Greg Aloupis, Stefan Langerman, Godfried T. Toussaint, Henk G. 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

convexificationgeometric permutationComputation geometrypolygonal 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)

Cites Work

• Unnamed Item
• Morphing simple polygons
• On local transformation of polygons with visibility properties.
• Self-avoiding random loops
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Sorting by Transpositions
• On a Family of Polygons
• Sorting a bridge hand
• Convexification of polygons by flips and by flipturns

This page was built for publication: COMPUTING SIGNED PERMUTATIONS OF POLYGONS