O. Aichholzer, M. Hoffmann, M. J. Van-kreveld, and G. Rote, Graph drawings with relative edge length specifications, Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, 2014.

N. Sandeep, S. S. Bhatt, and . Cosmadakis, The complexity of minimizing wire lengths in VLSI layouts, Inf. Process. Lett, vol.25, issue.4, pp.263-267, 1987.

S. Cabello, E. D. Demaine, and G. Rote, Planar Embeddings of Graphs with Specified Edge Lengths, Journal of Graph Algorithms and Applications, vol.11, issue.1, pp.259-276, 2007.
DOI : 10.7155/jgaa.00145

J. Chen, A. Jiang, I. A. Kanj, G. Xia, and F. Zhang, Separability and topology control of quasi unit disk graphs, Wireless Networks, vol.11, issue.4, pp.53-67, 2011.
DOI : 10.1007/s11276-010-0264-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.7446

G. Di-battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, 1999.

G. Di-battista and L. Vismara, Angles of Planar Triangular Graphs, SIAM Journal on Discrete Mathematics, vol.9, issue.3, pp.349-359, 1996.
DOI : 10.1137/S0895480194264010

L. Doherty, K. S. Pister, and L. E. Ghaoui, Convex optimization methods for sensor node position estimation, Proceedings IEEE INFOCOM 2001 The Conference on Computer Communications, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Twenty years into the communications odyssey, pp.1655-1663, 2001.

P. Eades and N. C. Wormald, Fixed edge-length graph drawing is NP-hard, Discrete Applied Mathematics, vol.28, issue.2, pp.111-134, 1990.
DOI : 10.1016/0166-218X(90)90110-X
URL : http://doi.org/10.1016/0166-218x(90)90110-x

S. Held, B. Korte, D. Rautenbach, and J. Vygen, Combinatorial optimization in VLSI design, Combinatorial Optimization -Methods and Applications, volume 31 of NATO Science for Peace and Security Series -D: Information and Communication Security, pp.33-96, 2011.

M. Hoffmann, M. J. Van-kreveld, V. Kusters, and G. Rote, Quality ratios of measures for graph drawing styles, Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014, 2014.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, Unit disk graph approximation, Proceedings of the 2004 joint workshop on Foundations of mobile computing , DIALM-POMC '04, pp.17-23, 2004.
DOI : 10.1145/1022630.1022634
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.5740

D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra, Theoretical Computer Science, vol.7, issue.2, pp.217-236, 1978.
DOI : 10.1016/0304-3975(78)90051-8

C. Savarese, J. M. Rabaey, and K. Langendoen, Robust positioning algorithms for distributed ad-hoc wireless sensor networks, Proceedings of the General Track: 2002 USENIX Annual Technical Conference, pp.317-327, 2002.