Realizing Planar Linkages in Polygonal Domains

Abstract

Full Citation:

Depian, Thomas, Haase, Carolina, Nöllenburg, Martin, Schulz, André. Realizing Planar Linkages in Polygonal Domains. International Workshop on Combinatorial Algorithms (IWOCA'26) (Foucaud, F. and Parreau, A.), volume 16587 of LNCS, pages 251–265, 2026, Springer.

Thomas Depian

Thomas Depian is a University Assistant at the Algorithms and Complexity Group.

Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.