Fast multiscale graph layouts in 2D and 3D.
Maintainer: Pawel Gajer [email protected]
Authors:
Pawel Gajer [email protected]
The recommended workflow is grip() with
metric = "hop" for topology-first layouts or
metric = "edge_length" when positive edge lengths define the graph
metric. The package also
provides score.layout() and
compare.layouts() for real-data layout selection,
trace.grip() for multiscale diagnostics under either metric,
and advanced public experimental geodesic-KK helpers such as
prepare.edge.kk(),
prepare.geodesic.kk(),
score.geodesic.kk(),
prepare.landmark.geodesic.kk(), and
score.landmark.geodesic.kk() for weighted-layout
evaluation and refinement. Convenience graph generators such as
edges.path(), edges.sierpinski.triangle(),
and edges.sierpinski.tetrahedron(), quick plotting via
plot.layout(), and optional Shiny explorers round out the
package.
Gajer, P. and Kobourov, S.G. (2002). GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications, 6(3), 203--224. doi:10.7155/jgaa.00052.
Gajer, P., Goodrich, M.T. and Kobourov, S.G. (2004). A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry, 29(1), 3--18. doi:10.1016/j.comgeo.2004.03.014.
Useful links: