Network drawing with geographical constraints on vertices
Andrés Aiello, Manuel Abellanas Oar, Rodrigo I. Silveira, Gregorio Hernández Peñalver · 2005
In this paper we concentrate on an unexplored graph drawing problem: the one arising when each vertex of the graph represents a geographical region. For this problem we first define new aesthetic criteria. Secondly, several force-directed algorithms for finding layouts that satisfy those specific criteria are proposed, which successfully obtain much better drawings for this problem than the previous algorithms.