We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets node and edge types subject length orientation restrictions. show that already deciding feasibility such approximation problems is NP-hard, remains intractable even for very simple setups. then devise an algo...