  A method for embedding graphs in Euclidean space is suggested. The method
connects nodes to their geographically closest neighbors and economizes on the
total physical length of links. The topological and geometrical properties of
scale-free networks embedded by the suggested algorithm are studied both
analytically and through simulations. Our findings indicate dramatic changes in
the embedded networks, in comparison to their off-lattice counterparts, and
call into question the applicability of off-lattice scale-free models to
realistic, everyday-life networks.
