We propose a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem and leverage force-directed graph drawing algorithms in order to draw hypergraphs. We propose and discuss a number of criteria to evaluate the quality of the drawings from the points of view of aesthetics and of visualization and analytics. We empirically and comparatively evaluate the quality of the drawings based on these criteria on both synthetic and real data sets. Experiments reveal that the algorithms are generally effective and the drawings generated are aesthetically pleasing.
CITATION STYLE
Arafat, N. A., & Bressan, S. (2017). Hypergraph drawing by force-directed placement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10439 LNCS, pp. 387–394). Springer Verlag. https://doi.org/10.1007/978-3-319-64471-4_31
Mendeley helps you to discover research relevant for your work.