2 papers
cs.CG2018
Further Towards Unambiguous Edge Bundling: Investigating Power-Confluent Drawings for Network Visualization
Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two…
cs.CG2017
Graph Drawing by Stochastic Gradient Descent
Jonathan X. Zheng, Samraat Pawar, Dan F. M. Goodman
A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, know…