@inproceedings{oai:kumadai.repo.nii.ac.jp:00023785,
 author = {伊藤, 仁一 and Ito, Jin-ichi and Itoh, Jin-ichi and 伊藤, 仁一 and Ito, Jin-ichi and Itoh, Jin-ichi and O’Rourke, Joseph and Vîlcu, Costin},
 book = {Discrete and Computational Geometry},
 issue = {1},
 month = {Jul},
 note = {application/pdf, 論文(Article), We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q., http://www.springerlink.com/content/v2725l2665716424/},
 pages = {35--54},
 publisher = {Springer Science+Business Media},
 title = {Star unfolding convex polyhedra via quasigeodesic loops},
 volume = {44},
 year = {2010},
 yomi = {イトウ, ジンイチ and イトウ, ジンイチ}
}