Connecting polygonizations via stretches and twangs

DOI10.1007/S00224-009-9192-8zbMath1204.68243OpenAlexW2011160322MaRDI QIDQ1959392

Mirela Damian, Joseph O'Rourke, Robin Y. Flatland, Suneeta Ramaswami

Publication date: 6 October 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1345/

zbMATH Keywords

polygonsrandom polygonspolygonizationconnected configuration space

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On the Enumeration of Permutominoes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flips in planar graphs
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• On local transformation of polygons with visibility properties.
• Generating random polygons with given vertices

This page was built for publication: Connecting polygonizations via stretches and twangs