Paper by Erik D. Demaine

Reference:
Erik D. Demaine, Martin L. Demaine, and Ryuhei Uehara, “Developing a tetramonohedron with minimum cut length”, Computational Geometry: Theory and Applications, volume 108, 2023, pages 101903.
BibTeX
@Article{ShortestUnfolding_CGTA,
  AUTHOR        = {Erik D. Demaine and Martin L. Demaine and Ryuhei Uehara},
  TITLE         = {Developing a tetramonohedron with minimum cut length},
  JOURNAL       = {Computational Geometry: Theory and Applications},
  journalurl    = {https://www.sciencedirect.com/journal/computational-geometry},
  VOLUME        = 108,
  PAGES         = {101903},
  YEAR          = 2023,

  replaces      = {ShortestUnfolding_JCDCGGG2018},
  papers        = {ShortestUnfolding_JCDCGGG2018},
  doi           = {https://dx.doi.org/10.1016/J.COMGEO.2022.101903},
  dblp          = {https://dblp.org/rec/journals/comgeo/DemaineDU23},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1016/j.comgeo.2022.101903">ScienceDirect</A>.},
}

Comments:
This paper is also available from ScienceDirect.

Availability:
Currently unavailable. If you are in a rush for copies, contact me.
[Google Scholar search]

Related papers:
ShortestUnfolding_JCDCGGG2018 (Tetramonohedron Development with Minimum Cut Length)


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated January 22, 2026 by Erik Demaine.