Skip to main content
Conference Proceedings

A generalization of the source unfolding of convex polyhedra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7579 LNCS 185-199
DOI: 10.1007/978-3-642-34191-5_18
4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new method for unfolding a convex polyhedron into one piece without overlap, based on shortest paths to a convex curve on the polyhedron. Our "sun unfoldings" encompass source unfolding from a point, source unfolding from an open geodesic curve, and a variant of a recent method of Itoh, O'Rourke, and Vîlcu. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Demaine, E. D., & Lubiw, A. (2012). A generalization of the source unfolding of convex polyhedra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 185–199). https://doi.org/10.1007/978-3-642-34191-5_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free