Author:
Biedl Therese,Lubiw Anna,Sun Julie
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference20 articles.
1. On the complexity of the linkage reconfiguration problem;Alt,2003
2. When can you fold a map?;Arkin;Computational Geometry,2004
3. Nonoverlap of the star unfolding;Aronov;Discrete Comput. Geom.,1992
4. Ununfoldable polyhedra with convex faces;Bern;Comput. Geom.,2003
5. Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles;Biedl,2002
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Synthesis of fast and collision-free folding of polyhedral nets;Proceedings of the 2nd ACM Symposium on Computational Fabrication;2018-06-17
2. Folding cartons: Interactive manipulation of cartons from 2D layouts;Computer Aided Geometric Design;2018-05
3. STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA;International Journal of Computational Geometry & Applications;2011-08
4. Minimum cost open chain reconfiguration;Discrete Applied Mathematics;2011-08
5. Continuous Blooming of Convex Polyhedra;Graphs and Combinatorics;2011-03-17