Connecting polygonizations via stretches and twangs
type: Item
instance of: scholarly article
title: Connecting polygonizations via stretches and twangs
zbMATH Open document ID: 1204.68243
author: Mirela Damian
author: Robin Flatland
author: Joseph O'Rourke
author: Suneeta Ramaswami
published in: Theory of Computing Systems
publication date: 2010-10-06T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1345/
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5796569
zbMATH Keywords: polygons
zbMATH Keywords: polygonization
zbMATH Keywords: random polygons
zbMATH Keywords: connected configuration space
MaRDI profile type: Publication
OpenAlex ID: W2011160322
cites work: Q3158586
cites work: Flips in planar graphs
cites work: On polygons enclosing point sets
cites work: Q4910721
cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\)
cites work: On local transformation of polygons with visibility properties.
cites work: Q4878667
cites work: Q4224932
cites work: Q3135094
cites work: Q3216469
cites work: Generating random polygons with given vertices
DOI: 10.1007/S00224-009-9192-8
Recommended article: Q4910721
Recommended article: Knotting in stretched polygons
Recommended article: Pulling the straps of polygons
Recommended article: Asymptotics of linked polygons
Recommended article: Pseudotriangulations, polytopes, and how to expand linkages
Recommended article: Untangling polygons and graphs
Recommended article: Q5088936
Recommended article: Circumscribing polygons and polygonizations for disjoint line segments
description: scientific article; zbMATH DE number 5796569