Vertex Mesh Simplification Algorithm Based on Curvature and Distance Metric

Author(s):  
Yunliang Jiang ◽  
Wuyang Nie ◽  
Liang Tang ◽  
Yong Liu ◽  
Ronghua Liang ◽  
...  
2011 ◽  
Vol 36 (12) ◽  
pp. 1661-1673
Author(s):  
Jun GAO ◽  
Shi-Tong WANG ◽  
Xiao-Ming WANG

2009 ◽  
Vol 32 (2) ◽  
pp. 203-212 ◽  
Author(s):  
Yuan-Feng ZHOU ◽  
Cai-Ming ZHANG ◽  
Ping HE

2021 ◽  
Author(s):  
Tomoki Yoshida ◽  
Ichiro Takeuchi ◽  
Masayuki Karasuyama

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Silvia Zaoli ◽  
Piero Mazzarisi ◽  
Fabrizio Lillo

AbstractBetweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers. We propose a definition of betweenness centrality for temporal multiplexes. This definition accounts for the topological and temporal structure and for the duration of paths in the determination of the shortest paths. We propose an algorithm to compute the new metric using a mapping to a static graph. We apply the metric to a dataset of $$\sim 20$$ ∼ 20 k European flights and compare the results with those obtained with static or single-layer metrics. The differences in the airports rankings highlight the importance of considering the temporal multiplex structure and an appropriate distance metric.


Sign in / Sign up

Export Citation Format

Share Document