Algorithms for Manufacturing Paperclips and Sheet Metal Structures
dc.contributor.author | Arkin, Esther M. | |
dc.contributor.author | Fekete, Sándor P. | |
dc.contributor.author | Mitchell, Joseph S. B. | |
dc.date.accessioned | 2021-12-17T10:17:46Z | |
dc.date.available | 2021-12-17T10:17:46Z | |
dc.date.issued | 2001 | |
dc.description.abstract | We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a "carpenter's ruler") can be straightened, a problem that was open for several years and has only recently been solved in the affirmative. | en |
dc.identifier.issn | 2197-8085 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15958 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14731 | |
dc.language.iso | en | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
dc.subject.ddc | 510 Mathematik | en |
dc.subject.other | folding | en |
dc.subject.other | carpenter's rule conjecture | en |
dc.subject.other | geometric algorithms | en |
dc.subject.other | polygons | en |
dc.subject.other | NP-completeness | en |
dc.title | Algorithms for Manufacturing Paperclips and Sheet Metal Structures | en |
dc.type | Research Paper | en |
dc.type.version | submittedVersion | en |
tub.accessrights.dnb | free | en |
tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
tub.affiliation.institute | Inst. Mathematik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | en |
tub.series.issuenumber | 2001, 710 | en |
tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
tub.subject.msc2000 | 68U05 Computer graphics; computational geometry | en |
tub.subject.msc2000 | 68Q17 Computational difficulty of problems | en |