Assuming I have a graph $G$, with edges $E$ and vertices $V$, and the length of each edge is known, but the coordinates of vertices are not. Further assume that this is a graph that can be embedded on a 2D plane, what is the algorithm that can create a nice drawing with no edge intersection?Obviously there are many ways the graph can be drawn, and the definition of nice is a bit fuzzy (for practical purpose I would define it as something that is pleasing to the human eyes), but I would only need a good enough algorithm for this.Note there could be many graphs with its embedding and I frankly don't care the algorithm gives me which, as long as it is pleasant looking enough and it has all the above constraint satisfied. The motivation for this question is this: imagine that you have to design a circuit layout, the path that connects between two electronic components is $E$, and the vertex of each component is $V$, as a part of your engineering design you know that the distance between each component is pre-specified. As a designer, you would have to arrange the components on the board so that it looks nice. How can you design the circuit layout?
Graph planar drawing, with each edge's length is known
graph algorithms;cg.comp geom;planar graphs;embeddings
There is considerable work on the problem of finding planar embeddings with specified edge lengths. Survey and some results can be found in $[1]$.Cabello, S. and Demaine, E.D. and Rote, G., Planar embeddings of graphs with specified edge lengths, Graph Drawing, 283--294, 2004.