"Computational Complexity of Flattening Fixed-Angle Orthogonal Chains."

Erik D. Demaine et al. (2022)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2022-11-23

- no documents available
- export record
  dblp key:
  - conf/cccg/DemaineILU22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/DemaineILU22
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CCCG 2022: 98-104

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.