We study the problem of embedding graphs in plane as good geometric spanners. That is, for a graph G, goal is to construct straight-line drawing $$\Gamma $$ G such that, any two vertices u and v ratio between minimum length path from Euclidean distance small. The maximum ratio, over all pairs spanning . First, we show that deciding whether admits with 1, proper planar 1 are NP-complete, $$\exis...
