存在铰链式夹层
Hinged Dissections Exist
摘要:
我们证明,任何有限的多边形的面积相等的收集有一个共同的铰链解剖。也就是说,对于任何这样的多边形集合,存在一个在顶点处铰接的多边形链,该多边形链可以在平面中连续折叠而不自交以形成集合中的任何多边形。这一结果解决了关于多边形对之间存在铰链解剖的公开问题,该问题可以隐含地追溯到1864年,并在过去的十年中得到了广泛的研究。我们的结果推广并建立在1814年的结果之上,即多边形有共同的剖分(没有铰链)。我们还扩展了我们的共同解剖结果的固体3D多面体,有一个共同的(无铰链)的解剖,确定Dehn的1900年解决希尔伯特第三问题的边缘铰链解剖。我们的证明是建设性的,在所有情况下给出明确的算法。对于一个常数数量的平面多边形,我们的建设所需的片数和运行时间都是伪多项式。这个界限是最好的可能,即使是对于精神错乱的解剖。铰链解剖可能应用于可重构机器人,可编程物质和纳米制造。
英文摘要:
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form any polygon in the collection. This result settles the open problem about the existence of hinged dissections between pairs of polygons that goes back implicitly to 1864 and has been studied extensively in the past ten years. Our result generalizes and indeed builds upon the result from 1814 that polygons have common dissections (without hinges). We also extend our common dissection result to edge-hinged dissections of solid 3D polyhedra that have a common (unhinged) dissection, as determined by Dehn's 1900 solution to Hilbert's Third Problem. Our proofs are constructive, giving explicit algorithms in all cases. For a constant number of planar polygons, both the number of pieces and running time required by our construction are pseudopolynomial. This bound is the best possible, even for unhinged dissections. Hinged dissections have possible applications to reconfigurable robotics, programmable matter, and nanomanufacturing.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。