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

On universally easy classes for NP-complete problems., , and . SODA, page 910-911. ACM/SIAM, (2001)Solving the Rubik's Cube Optimally is NP-complete., , and . CoRR, (2017)The complexity of UNO, , , , and . CoRR, (2010)Efficient constant-velocity reconfiguration of crystalline robots., , , , , , , , , and 1 other author(s). Robotica, 29 (1): 59-71 (2011)Open Problems from CCCG 2009, and . Proceedings of the 21st Canadian Conference on Computational Geometry, Winnipeg, Manitoba, (2010)To appear..Geometric folding algorithms - linkages, origami, polyhedra., and . Cambridge University Press, (2007)Canadians Should Travel Randomly., , , and . ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 380-391. Springer, (2014)Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams., , , , , , and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 80-92. Springer, (2006)Basic network creation games., , , and . SPAA, page 106-113. ACM, (2010)Folding and Unfolding Linkages, Paper, and Polyhedra.. JCDCG, volume 2098 of Lecture Notes in Computer Science, page 113-124. Springer, (2000)