It has been a while I have not practiced mathematics but I should have enough background to get your answers if well detailed.
I have an n-by-n matrix, let's call it D, where dij represents the euclidian distance between Pi = (xi,yi) and Pj = (xj,yj). I want to find P1...Pn respecting those distances to place them on a graph to display to the user of my application.
I'm aware there not necessarily exists an exact solution (and not necessarily unic), therefore I'm only looking for a numeric solution. What approach do you propose ?