Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm. Damian, M.; Demaine, E. D.; and Flatland, R. Y. Graphs and Combinatorics (GC), 30(1):125-140, 2014.
Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm [link]Paper  bibtex   
@article{ dblp1728635,
  title = {Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm},
  author = {Mirela Damian and Erik D. Demaine and Robin Y. Flatland},
  author_short = {Damian, M. and Demaine, E. D. and Flatland, R. Y.},
  bibtype = {article},
  type = {article},
  year = {2014},
  key = {dblp1728635},
  id = {dblp1728635},
  biburl = {http://www.dblp.org/rec/bibtex/journals/gc/DamianDF14},
  url = {http://dx.doi.org/10.1007/s00373-012-1257-9},
  journal = {Graphs and Combinatorics (GC)},
  pages = {125-140},
  number = {1},
  volume = {30},
  text = {Graphs and Combinatorics (GC) 30(1):125-140 (2014)}
}
Downloads: 0