Answers are grounded in this paper and cite their sources.
The visibility graph method is used to transform time series into complex networks. In this letter, a fast transform algorithm is proposed for obtaining a visibility graph. Based on the strategy of "divide & conquer," the time complexity of the proposed algorithm is raised to O(n log n), which is more efficient than the previous basic algorithm whose time complexity is O(n(2)).
No takes yet. Share an insight, caveat, or question.
Lan et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: