|
|||||
|
|
Continuous Blooming of Convex Polyhedra |
|
| Authors: | Erik D. Demaine Martin L. Demaine Vi Hart John Iacono Stefan Langerman Joseph O��Rourke |
| Affiliation: | 1. MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA, 02139, USA 2. http://vihart.com 3. Department of Computer Science and Engineering, Polytechnic Institute of NYU, Brooklyn, NY, USA 4. Ma?tre de recherches du F.R.S.-FNRS, D??partment d??Informatique, Universit?? Libre de Bruxelles, Brussels, Belgium 5. Department of Computer Science, Smith College, Northampton, MA, 01063, USA |
| Abstract: | We construct the first two continuous bloomings of all convex polyhedra. First, the source unfolding can be continuously bloomed. Second, any unfolding of a convex polyhedron can be refined (further cut, by a linear number of cuts) to have a continuous blooming. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |