Algorithms for Manufacturing Paperclips and Sheet Metal Structures

dc.contributor.authorArkin, Esther M.
dc.contributor.authorFekete, Sándor P.
dc.contributor.authorMitchell, Joseph S. B.
dc.date.accessioned2021-12-17T10:17:46Z
dc.date.available2021-12-17T10:17:46Z
dc.date.issued2001
dc.description.abstractWe 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.issn2197-8085
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/15958
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-14731
dc.language.isoenen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.ddc510 Mathematiken
dc.subject.otherfoldingen
dc.subject.othercarpenter's rule conjectureen
dc.subject.othergeometric algorithmsen
dc.subject.otherpolygonsen
dc.subject.otherNP-completenessen
dc.titleAlgorithms for Manufacturing Paperclips and Sheet Metal Structuresen
dc.typeResearch Paperen
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfreeen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften::Inst. Mathematikde
tub.affiliation.facultyFak. 2 Mathematik und Naturwissenschaftende
tub.affiliation.instituteInst. Mathematikde
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber2001, 710en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
tub.subject.msc200068U05 Computer graphics; computational geometryen
tub.subject.msc200068Q17 Computational difficulty of problemsen

Files

Original bundle
Now showing 1 - 2 of 2
Loading…
Thumbnail Image
Name:
Report-710-2001.pdf
Size:
17.97 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
Report-710-2001.ps.gz
Size:
138.37 KB
Format:
Unknown data format

Collections