Simplifying TugGraph using zipping algorithms
作者：
Highlights：
• We generalise zipping algorithms for segmentation hierarchy editing to simplify the popular TugGraph visualisation algorithm.
• Our SimpleTug approach is modular, straightforward, and saves memory and time compared to existing TugGraph implementations.
• We prove its equivalence to other methods, show its effectiveness, and discuss how TugGraph and zipping are connected.
• These connections help pin down what TugGraph is really doing, making it easier to reason about in future.
• We further show how SimpleTug and an existing TugGraph method can be parallelised.
摘要
•We generalise zipping algorithms for segmentation hierarchy editing to simplify the popular TugGraph visualisation algorithm.•Our SimpleTug approach is modular, straightforward, and saves memory and time compared to existing TugGraph implementations.•We prove its equivalence to other methods, show its effectiveness, and discuss how TugGraph and zipping are connected.•These connections help pin down what TugGraph is really doing, making it easier to reason about in future.•We further show how SimpleTug and an existing TugGraph method can be parallelised.
论文关键词：Graph visualisation,TugGraph,Cluster hierarchy,Zipping algorithms
论文评审过程：Received 31 March 2019, Revised 29 January 2020, Accepted 1 February 2020, Available online 3 February 2020, Version of Record 20 February 2020.
论文官网地址：https://doi.org/10.1016/j.patcog.2020.107257
