Transect-based three-dimensional road modeling and visualization

On the basis of the study on road elements and the existing three-dimensional road data models, this paper puts forward the transect-based road modeling, resolves the modeling of the simplest road with two road transects, and fulfils the visualization of the road. OpenGL is applied as the tool of visualization. The map texture technology, LOD algorithm and dynamic multi-differentiating texture technology are of benefit to the construction of 3D road GIS, and improve the speed of roaming and effective visualization. This paper also disusses the combination of 2D digitall road map and 3D road scene, and the dynamic response between them. Finally, on the basis of the research on the transect-based road model, this paper develops the three-dimen-sional road geographic information system called virtual road ( VRoad ), which not only supplies road designers with a set of tool which can turn the designed 2D road data into 3D road and the high road assistant function area in computer, but also supplies the road management with a set of tool which can realize the road real time and interactive roaming, high-efficiency management.     

一种支持城市路网交通关系自动化的智能模型

针对车载导航、地图网站等应用中路网要素之间交通关系维护的难题,提出一种支持路网要素交通关系自动化的智能过程模型,将路网要素交通关系自动化过程理解为由路网要素间的空间和语义关系、规则集和控制系统组成的产生式系统.该产生式系统可在路网要素空间和语义信息基础上,通过定义可扩展的交通关系规则集,自动化地生成符合应用需求的路网要素间的交通关系.此外,在该产生式系统中引入触发器概念监控和响应几何网络及其交通关系规则集的变更,实时更新逻辑网络中的连通关系信息,实现几何网络、规则集和逻辑网络三者的一致性.同时,提出路网要素交通关系处理的控制策略和关键流程,并对该智能网络模型的有效性进行了验证.

Abstract：

Maintaining the traffic connectivity relations between road features has always been a time consuming task for in-vehicle navigation, map website, and other traveling service related applications. Such a task has been commonly conducted artificially and inevitably inefficient, yet makes data quality control difficult. Considering the intrinsic rules of traffic connectivity formed by the geometrical structures, spatial and semantic relationships between road features in city road networks, an intelligent processing model is set forward in this paper for traffic connectivity automation. It is argued that traffic connectivity automation between road features is fundamentally a production system composed of the spatial and semantic relations between road features, connectivity rules and control system. With the implementation of an extendable connectivity rule set, the traffic connectivity relations between road network features are built automatically based on the spatial and semantic information of road network. The trigger concept is adopted to monitor and respond the changes in geometrical network and connectivity rules, and then dynamically updates the traffic connectivity between road network features in logical network so as to guarantee the consistence between geometrical network, connectivity rules and logical network. A series of control strategies and a conducting engine are developed to maintain the traffic connectivity relations. A case study conducted on a real road network verifies the effects of the proposed intelligent model.     

Unification and Harmonization in True Color Image City Map

True color image city map is a sort of new-style map which combines the high resolution image and map symbols and shows both advantages in visualization. At the same time, the map unification and harmonization should be taken into account dur-ing the design process, since some visual conflicts appear when map symbols overlaid on the true color image. The objective of this research is to explore the rules in the process of true color image city map design based on chromatic and aesthetic knowledge. At the end, taking the Image Atlas of Guangzhou as an example, image color adjustment, road network presentation, and symbol de-signing issues will be discussed in the application.     

A mobile GIS application to heavily resource-constrained devices

GIS applications to mobile devices are becoming increasingly popular, utilizing a di-verserange of devices. Many of these devices suffer from serious constraints in three main areas: processor speed, memory space and screen size. This paper presents a (;IS application, called “MacauMap“. that is intended for heavily resource-constrained handheld devices. MacauMap is a tourism oriented map application of the Macau territory for PalmOS and Pocket PC personal digital assistants. It was designed to perform satisfactorily on devices with as little as 16 MHz processor speed, and requires only 500 KB available memory for the GIS application and all GIS data. Memory requirements are kept low through a specially designed data format. The main challenge of satisfactory map drawing speed is addressed through a variety of techniques that were developed for this application. The paper describes the application‘s data format, outlines the map drawing techniques, and points out the areas for future development.     

Geo-rough Space

Rough set is a new approach to uncertainties in spatial analysis.in this paper,rough set symbols are simplified and standardized in terms of rough interpretation and specialized indication.Rough spatial entities and their topological relationships are also proposed in rough space,thus a universal intersected equation is developed,and rough membership function is further extended with the gray scale in our case study.We complete three works.First,a set of simplified rough symbols is advanced on the basis of existing rough symbols.Second.Rough spatial entity is put forwark to study the real world as it is ,without forcing uncertainties into crisp set.Third,rough spatial topological relationships are studied by using rough matrix and their figures.The relationships are divided into three types,crisp entity and crisp entity(CC),rough entity and crisp entity (RC),and rough entity and rough entity (RR),A universal intersected equation is further proposed.Finally,the maximum and minimum maps of river thematic classification are genrated via rough memebership function and rough relationships in our case study.     

An Approach to Reasoning Topological Relations Between Areal Objects Under Randomness

This paper describes the geometric and statistical properties of areal object under randomness. In order to describe formally such a uncertain topological relation, a new formal model (i. e. 4ID model) is proposed. On the basis of this, the effects of positional uncertainty on topological relations between areal objects are investigated in detail. Some possibility functions for the determination of relations are constructed based on the assumption that randomness of point location complies with a normal distribution, and the concept of uncertain sets of topological relations under randomness is introduced.     

Constrained Edge Dynamic Deleting in CD-TIN Based on Influence Domain Retriangulation of Virtual Point

Constrained Delaunay triangulated irregular network is one kind of dynamic data structures used in geosciences. The research on point and edges insertion in CD-TIN is the basis of its application. Comparing with the algorithms of points and constrained edge insertion, there are very a few researches on constrained edge deletion in CD-TIN. Based on the analysis of the polymorphism of constrained edge, virtual points are used to describe the intersection of constrained edges. A new algorithm is presented, called as influence domain retriangulating for virtual point (IDRVP), to delete constrained edges with virtual points. The algorithm is complete in topology. Finally, the algorithm is tested by some applications cases.     

DESIGN AND REALIZATION OF MAP DIGITIZATION SYSTEM ON MICRO-COMPUTER BASED MAP GRAPHIC WORKSTATION

The main purpose to develop a Map Graphic Workstation on thewidely used micro-computer is that by it the whole processing of map data fromcapturing,managing,editing,updating to graphic outputting can be realized.Map Digitization System（MDS）is the software system to deal with the initial andalso the most important processing.In this paper,the authors introduce a MDSon a micro-computer based Map Grphic Workstation that has been qualitified forthe producation of digital map.Since the system is designed totally independentlyand in the general frame of the Map Graphic Workstation,the capturing and man-aging and other processings for map data are in an integral manner,in which theproducation of digital map can be fulfilled conveniently.At the same time,thesystem is flexible for function extension and widely applicable to the data from dif-ferent sources and with different information characterisitcs(e.g.,the processingof Chinese characters on map).     

数字地形建模的真三维TIN算法研究(英文)

The problem of taking an unorganized point cloud in 3D space and fitting a polyhedral surface to those points is both important and difficult. Aiming at increasing applications of full three dimensional digital terrain surface modeling, a new algorithm for the automatic generation of three dimensional triangulated irregular network from a point cloud is proposed. Based on the local topological consistency test, a combined algorithm of constrained 3D Delaunay triangulation and region-growing is extended to ensure topologically correct reconstruction. This paper also introduced an efficient neighboring triangle location method by making full use of the surface normal information. Experimental results prove that this algorithm can efficiently obtain the most reasonable reconstructed mesh surface with arbitrary topology, wherein the automatically reconstructed surface has only small topological difference from the true surface. This algorithm has potential applications to virtual environments, computer vision, and so on.     

Spatial Relation Resolution and Spatial Relation Abstraction

This paper attempts to regard spatial relation transformation as an important process in map generalization. The spatial relation generalization can be divided into the components of abstraction: topology, distance and orientation. The concept‘‘ spatial relation resolution‘‘ is introduced to describe the constraints of relative spatial relation. On the basis of nine intersection models, the cardinal direction models and the iso-dis-tance-relation models, this paper gives three sorts of relation resolution representations for topological, distance and orientation relation, respectively. Two mapping implementations in map generalization is discussed.     

Schematic road network map progressive generalization based on multiple constraints

Multiple constraints for schematic road network map cartographic design are analyzed and summarized. Based on this, a set of quantitative criteria are set up and a new road network generalization method including progressive selection and displacement is proposed. Furthermore, topological checking methods for road networks are researched. Based on these constraints, the points in a road network are classified, and a satisfactory and effective schematic map is designed in a concrete experiment while maintaining topological consistency of the road network between the original and the schematic map.     

道路网示意性地图的渐进式综合研究

研究并总结了示意性道路网地图的制图规则,量化了约束条件,提出了一种道路网渐进式图形简化方法和移位方法,并研究了拓扑关系检查方法。在具体实验中,通过对道路网上点的分类,依据约束条件,快速生成有效的道路网示意性地图,同时保证了原始道路图与示意性道路图之间的拓扑关系一致性。     

Stroke构造、移位一体化的道路网示意化方法

针对当前常用示意性地图生成方法中往往存在简化程度不够、未考虑长度信息以及时间效率低等问题,提出了stroke构造、移位一体化的道路网示意化方法。该方法在对道路网进行stroke划分构造的同时,直接对其进行渐进式的移位示意化及拓扑检查。同时本文还提出利用相似分形维数来定量比较并验证不同示意化方法的有效性。试验表明,本算法在考虑原始线形的基础上,示意化过程简单,时间效率较高,减少了拓扑冲突问题,保证了拓扑一致性及路网的均衡分布,具有较好的清晰度和认知度。     

道路地图示意性表达的可用性评估

当前示意性地图表达主要针对公共交通网络,缺乏对道路地图示意性表达可用性评估研究。本文选取景区和街道两个典型道路场景,采用最新的自动示意化方法生成示意地图,以主观问卷调查结合客观眼动试验的方式,评估道路地图示意性表达的可用性。试验结果表明:①示意性表达能够提升道路地图的简化度、清晰度及用户满意度,尤其对于原始道路形状较为复杂的情况;②示意地图中路径形状简化会造成不同路径感知长度差异的改变,从而影响到人们路径抉择行为;③对于路径示意性结果增加了道路网密集程度的情况,会降低示意地图认知效率。本文研究成果有助于道路地图自动示意性表达规则完善和方法优化,能够进一步提升地图示意性表达的实用性。     

空间分析方法在道路网自动综合拓扑构建中的应用

在道路网的自动综合中,一般的方法都必须对道路网进行自动拓扑生成,建立起点、线、面之间的关系,以利于道路选取时网眼的分析和选取后的路径分析。本文考虑到数字地图的数据特点,在进行道路网自动拓扑过程中,对经常遇到的线状要素无法合理构面的问题进行分析并提出了合理的解决方法。方法中主要运用了缓冲区分析和叠置分析,通过把居民地层数据叠置到道路层数据进行联合分析,为道路网的自动选取构建出了正确的空间拓扑关系。     

对偶图节点重要度的道路网自动选取方法

采用对偶拓扑方法构建基于广义路网拓扑的复杂交通网络,通过引入m阶邻居节点概念,考虑复杂交通网络中节点度、介中心及节点间距离等因素,顾及节点自身及1到m阶邻居节点的重要度贡献,定义了节点重要度评价模型,进而提出一种基于m阶邻居节点重要度贡献的道路网自动选取方法,并基于网络最小规模原则保持选取道路的连通性。为检验方法的有效性,引入度分布评价所选取道路对路网整体结构及拓扑特性的保持程度,并采用实际城市路网进行试验,结果表明本文方法选取的路网能较好地保持了原始路网的整体结构、拓扑特性及道路连通性,且算法稳定、可靠。     

General Principles for Automated Generation of Schematic Network Maps

Usually, a street map contains various types of detailed information and appears to be crowded. As a result, to many users, a street map looks complicated and is not easy to read and follow. In fact, to a certain degree, too much detail makes the map uninformative and noisy. The London tube map, called a schematic or topological map in some literature, has often been cited as an excellent example of a simplified map. Algorithms have been developed by researchers to automate the generation of schematic maps for road networks. However, it is found that there is still a lack of defined general principles and here four general principles have been formulated for schematisation – the Principle of the Preservation of the Topological Relationship; the Principle of the Preservation of the Main Structure of the Line Network; the Principle of Relativity in Position; and the Principle of Relativity in Length. The first two are the principles of preservation: these two should never be violated. The last two are principles of relativity: it is very desirable to keep these two intact unless there is an absolute need to violate them.     

道路网络示意图的多边形生长算法

道路网络示意图是实体网络的抽象表示,因其更加符合人的认知习惯,在地图服务与地图制图领域已得到初步应用。以路径为单位的网络示意图自动生成算法只顾及节点与线段的局部布置,且较难以维护网络拓扑一致性。本文以闭合多边形(网眼)为基本单位,利用网眼的独立性与邻接性,提出了多边形生长算法,核心思想是将道路网络分类为闭合多边形与非闭合线段,以闭合多边形提取、映射、优化为主线,辅助组合非闭合线段。算例分析验证,本算法在网络均衡分布及拓扑一致性方面具有优势。     

基于复杂网络理论的城市道路网络自动综合方法

道路网络自动综合是地图综合的主要研究课题。本文通过引入对偶拓扑理论建立了城市道路网络的对偶拓扑结构,并将道路的重要性表达为路网中所有道路的重要度贡献的总和,进而提出了一种道路网络自动综合方法。实验表明,本文方法可以较为合理地选取路网中相对重要的道路,所选路网保持了原始路网的整体形态及拓扑连通。     

顾及拓扑联通性的互通式立交桥增量更新

由于互通式立交桥错综复杂的拓扑结构特点,使互通式立交桥更新时存在拓扑联通性维护困难的问题,针对该问题提出一种顾及拓扑联通性的互通式立交桥增量更新方法。该方法以21种互通式立交桥类型为基础,通过分析每种类型的拓扑结构特点,用计算匝道数和平面交点数组成的二元组值来识别这21种互通式立交桥;根据不同类型互通式立交桥需要维护的拓扑联通点和空间变化类型,设计66条互通式立交桥增量更新规则;最后在课题组1∶1万全球典型要素增量更新原型系统基础上,开发立交桥增量更新模块,实现互通式立交桥增量更新处理及拓扑联通关系维护的自动化。并以长沙市OSM道路网数据为试验数据,将其转换为1∶1万道路数据,验证本文方法的有效性。