Unfolding Convex Polyhedra via Quasigeodesic Star Unfoldings

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We extend the notion of a star unfolding to be based on a simple 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, planar polygon: shortest paths from all vertices of P to Q are cut, and all but one segment of Q is cut.
18 pages, 10 figures

Keywords

Computational Geometry, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/210516

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0812.2257
 http://arxiv.org/abs/0812.2257

Collections

arXiv