LIPIcs.SoCG.2018.76.pdf
- Filesize: 0.83 MB
- 4 pages
Document
Star Unfolding of Boxes (Multimedia Exposition)
Authors
-
Part of:
Volume:
34th International Symposium on Computational Geometry (SoCG 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Computational Geometry (SoCG) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-06-08
Cite AsGet BibTex
Dani Demas, Satyan L. Devadoss, and Yu Xuan Hong. Star Unfolding of Boxes (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 76:1-76:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.SoCG.2018.76
https://doi.org/10.4230/LIPIcs.SoCG.2018.76
Abstract
Given a convex polyhedron, the star unfolding of its surface is obtained by cutting along the shortest paths from a fixed source point to each of its vertices. We present an interactive application that visualizes the star unfolding of a box, such that its dimensions and source point locations can be continuously toggled by the user.
Keywords
- star unfolding
- source unfolding
- Voronoi diagram
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- A.D. Alexandrov. Convex Polyhedra. Springer Monographs in Mathematics. Springer Berlin Heidelberg, 2006. URL: https://books.google.com/books?id=aoMreDT_DwcC.
- Boris Aronov and Joseph O'Rourke. Nonoverlap of the star unfolding. Discrete & Computational Geometry, 8(3):219-250, Sep 1992. URL: http://dx.doi.org/10.1007/BF02293047.
-
Satyan L. Devadoss and Joseph O'Rourke. Discrete and Computational Geometry. Princeton University Press, 2011.
- Raymond Hill. Javascript-voronoi. https://github.com/gorhill/Javascript-Voronoi, 2013.