Bounded-Degree Polyhedronization of Point Sets
URL to paper listed on conference site
Main Authors: | Barequet, Gill, Benbernou, Nadia M., Charlton, David, Demaine, Erik D., Demaine, Martin L., Ishaque, Mashhood, Lubiw, Anna, Schulz, Andre, Souvaine, Diane L., Toussaint, Godfried T., Winslow, Andrew |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
University of Manitoba
2011
|
Online Access: | http://hdl.handle.net/1721.1/62798 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
by: Benbernou, Nadia M., et al.
Published: (2021) -
Universal hinge patterns for folding strips efficiently into any grid polyhedron
by: Demaine, Erik D, et al.
Published: (2021) -
Origamizer: A practical algorithm for folding any polyhedron
by: Demaine, Erik, et al.
Published: (2021) -
Origamizer: A practical algorithm for folding any polyhedron
by: Demaine, Erik, et al.
Published: (2021) -
Algorithms for Designing Pop-Up Cards
by: Abel, Zachary Ryan, et al.
Published: (2014)