On the basis of investigating the statistical data of bus transport networks of three big cities in China,wepropose that each bus route is a clique(maximal complete subgraph)and a bus transport network(BTN)consists of...On the basis of investigating the statistical data of bus transport networks of three big cities in China,wepropose that each bus route is a clique(maximal complete subgraph)and a bus transport network(BTN)consists of alot of cliques,which intensively connect and overlap with each other.We study the network properties,which includethe degree distribution,multiple edges' overlapping time distribution,distribution of the overlap size between any twooverlapping cliques,distribution of the number of cliques that a node belongs to.Naturally,the cliques also constitute anetwork,with the overlapping nodes being their multiple links.We also research its network properties such as degreedistribution,clustering,average path length,and so on.We propose that a BTN has the properties of random cliqueincrement and random overlapping clique,at the same time,a BTN is a small-world network with highly clique-clusteredand highly clique-overlapped.Finally,we introduce a BTN evolution model,whose simulation results agree well withthe statistical laws that emerge in real BTNs.展开更多
Delaunay三角网是DEM主要表示方式,但一直以来,因其数据结构和构造算法的复杂性导致其应用受限。本文针对此,结合随机增量式算法理论,提出一种全新的有向无环图(directed acyclic graph,DAG)[5]查找数据结构(search data structure)和...Delaunay三角网是DEM主要表示方式,但一直以来,因其数据结构和构造算法的复杂性导致其应用受限。本文针对此,结合随机增量式算法理论,提出一种全新的有向无环图(directed acyclic graph,DAG)[5]查找数据结构(search data structure)和随机增量式[7,10]Delaunay三角网构造算法来解决这一问题。展开更多
Delaunay三角网是DEM主要表示方式，一直以来，因其数据结构和构造算法的复杂性导致应用受限。本文结合随机增量式算法理论，提出一种全新的有向无环图（directed acyclic graph，DAG）查找数据结构（search data structure）和随机增量...Delaunay三角网是DEM主要表示方式，一直以来，因其数据结构和构造算法的复杂性导致应用受限。本文结合随机增量式算法理论，提出一种全新的有向无环图（directed acyclic graph，DAG）查找数据结构（search data structure）和随机增量式Delaunay三角网构造算法，并对算法作了简要证明和深入分析。该算法最大的特点是具有随机特性，能够支持地形特征数据的动态更新。展开更多
基金supported by National Natural Science Foundation of China under Grant Nos.60504027 and 60874080the Postdoctor Science Foundation of China under Grant No.20060401037
文摘On the basis of investigating the statistical data of bus transport networks of three big cities in China,wepropose that each bus route is a clique(maximal complete subgraph)and a bus transport network(BTN)consists of alot of cliques,which intensively connect and overlap with each other.We study the network properties,which includethe degree distribution,multiple edges' overlapping time distribution,distribution of the overlap size between any twooverlapping cliques,distribution of the number of cliques that a node belongs to.Naturally,the cliques also constitute anetwork,with the overlapping nodes being their multiple links.We also research its network properties such as degreedistribution,clustering,average path length,and so on.We propose that a BTN has the properties of random cliqueincrement and random overlapping clique,at the same time,a BTN is a small-world network with highly clique-clusteredand highly clique-overlapped.Finally,we introduce a BTN evolution model,whose simulation results agree well withthe statistical laws that emerge in real BTNs.
文摘Delaunay三角网是DEM主要表示方式,但一直以来,因其数据结构和构造算法的复杂性导致其应用受限。本文针对此,结合随机增量式算法理论,提出一种全新的有向无环图(directed acyclic graph,DAG)[5]查找数据结构(search data structure)和随机增量式[7,10]Delaunay三角网构造算法来解决这一问题。
文摘Delaunay三角网是DEM主要表示方式，一直以来，因其数据结构和构造算法的复杂性导致应用受限。本文结合随机增量式算法理论，提出一种全新的有向无环图（directed acyclic graph，DAG）查找数据结构（search data structure）和随机增量式Delaunay三角网构造算法，并对算法作了简要证明和深入分析。该算法最大的特点是具有随机特性，能够支持地形特征数据的动态更新。
