Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Willoughby, Joel"'
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint systems, w
Externí odkaz:
http://arxiv.org/abs/1507.01158
Autor:
Sitharam, Meera, Willoughby, Joel
We consider a generalization of the concept of $d$-flattenability of graphs - introduced for the $l_2$ norm by Belk and Connelly - to general $l_p$ norms, with integer $P$, $1 \le p < \infty$, though many of our results work for $l_\infty$ as well. T
Externí odkaz:
http://arxiv.org/abs/1503.01489