Author of the publication

Finding Closed Quasigeodesics on Convex Polyhedra.

, , and . SoCG, volume 164 of LIPIcs, page 33:1-33:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Continuous Flattening of All Polyhedral Manifolds using Countably Infinite Creases., , , , , , and . CoRR, (2021)2048 Without Merging., , , , and . CCCG, page 285-291. (2020)Box Pleating is Hard., , , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 167-179. Springer, (2015)Computing 3SAT on a Fold-and-Cut Machine., , , and . CCCG, page 208-213. (2017)Finding Closed Quasigeodesics on Convex Polyhedra., , and . SoCG, volume 164 of LIPIcs, page 33:1-33:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Infinite All-Layers Simple Foldability., , , , , and . Graphs Comb., 36 (2): 231-244 (2020)Folded Structures Satisfying Multiple Conditions., and . J. Inf. Process., (2017)Landmark mapping from unbiased observations., , and . ISC2, page 1-6. IEEE, (2015)Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces., , , , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 180-192. Springer, (2015)Rigid origami vertices: conditions and forcing sets., , , , , , , and . J. Comput. Geom., 7 (1): 171-184 (2016)