Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.
In: Sack, J., Urrutia, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Realizing Planar Linkages in Polygonal Domains
Linkage realization in polygonal domains is W[1]-hard parameterized by graph size and NP-hard for paths with prescribed endpoints, with a linear-time algorithm for short paths in convex polygons.