CN108628952A - Complex road interior accessibility analysis method and system based on road centerline - Google Patents

Complex road interior accessibility analysis method and system based on road centerline Download PDF

Info

Publication number
CN108628952A
CN108628952A CN201810297842.6A CN201810297842A CN108628952A CN 108628952 A CN108628952 A CN 108628952A CN 201810297842 A CN201810297842 A CN 201810297842A CN 108628952 A CN108628952 A CN 108628952A
Authority
CN
China
Prior art keywords
path
road
end
start
topology
Prior art date
Application number
CN201810297842.6A
Other languages
Chinese (zh)
Inventor
魏金占
岳国森
王礼江
吴宁
丁孝兵
朱广堂
Original Assignee
佛山市测绘地理信息研究院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 佛山市测绘地理信息研究院 filed Critical 佛山市测绘地理信息研究院
Priority to CN201810297842.6A priority Critical patent/CN108628952A/en
Publication of CN108628952A publication Critical patent/CN108628952A/en

Links

Abstract

The invention discloses a complex road interior accessibility analysis method based on a road centerline, which comprises the following steps of: A, acquiring an original geographic map; B, carrying out grid vector conversion processing on the original geographic map to extract the road model in the original geographic map; C, extracting the road centerline in the road model; D, constructing a leading line respectively for a start point and an end point, wherein the leading line corresponding to the start point is a start point leading line, and the leading line corresponding to the end pointis an end point leading line; E, carrying out space topology processing on the road centerline to construct a topological path; F, removing redundant topological paths and returning to step E until only one topological path connecting the start point, the end point and the leading line is left. The invention also discloses a complex road interior accessibility analysis system based on a road centerline. According to the invention, complex road solutions can be extended to the field of space topology analysis, and the method has the advantages of easy realization, high efficiency, stability, and strong applicability.

Description

基于道路中线的复杂道路内部通达性分析方法及系统 Based on the center line of the road complex internal road accessibility and analysis system

技术领域 FIELD

[0001] 本发明涉及计算机图形学与地理信息科学技术领域,尤其涉及一种基于道路中线的复杂道路内部通达性分析方法及一种基于道路中线的复杂道路内部通达性分析系统。 [0001] The present invention relates to the field of computer graphics with geographical information technology science, in particular, relates to a complex internal Roads midline access analysis method and based on the road line of the road complex internal access Analysis System.

背景技术 Background technique

[0002] 迷宫路径解算自古就是数学与计算机图形学的研宄热点,在现代科学应用中,迷宫路径解算多应用于复杂交通路径计算以及复杂障碍物地形中的路径计算,广泛应用于军事及民用领域;但是传统的迷宫路径解算多从图论及数学角度,其搜索效率和准确度都不尽人意,特别是当迷宫的复杂程度达到一定级别,计算机和传统算法将无能为力。 [0002] labyrinth path solver has always been a hot spot in a Subsidiary mathematics and computer graphics in modern scientific applications, the labyrinth path solver used in complex multi-path calculations, and transport path in complex terrain obstacles calculation, widely used in military and civilian areas; but the traditional path maze solver and more deals from a mathematical point of view its search efficiency and accuracy are unsatisfactory, especially when the complexity of the maze to reach a certain level, and traditional computer algorithm will do nothing.

[0003]再者古人云不识庐山真面目只缘身在此山中,从另一个角度说明迷宫的内部两点之间的通达分析更为复杂,这也是迷宫解算迄今最为研宄涉猎较少,未能在理论和技术上实现完美突破的核心难题。 [0003] Note that old saying not know the truth just because in the mountains, from another angle between the access points in the interior of the analysis is more complex maze, which is by far the most resolver study based maze less covered, failure to achieve a breakthrough perfect core problems in theory and technology. 也即如此才有军事学中各种借助复杂战场环境,使得敌方难于快速抵达我方位置进而获得战斗胜利的千古传奇,因此如何在身处复杂地理环境下,快速到达目标点即成为军事学、计算机图形学、数学等领域研究的热点和技术瓶颈。 That is true only by means of military science in a variety of complex battlefield environment, making it difficult to quickly reach our enemy position and then get through the ages legendary victory in battle, how to live in a complex geographical environment, to quickly reach the target point becomes Military Science study of computer graphics, mathematics and other hot spots and bottlenecks.

发明内容 SUMMARY

[0004]本发明所要解决的技术问题在于,提供一种易于实现、高效稳定、适用性强、基于道路中线的复杂道路内部通达性分析方法及系统,可将复杂道路解算扩展到空间拓扑分析领域,以求解出复杂道路。 [0004] The present invention solves the technical problem is to provide an easy to implement, efficient and stable, applicability, based on a complex analysis of internal Roads line method and system accessibility, can be extended to complex road resolver topological analysis field, to solve complex way.

[0005]为了解决上述技术问题,本发明提供了一种基于道路中线的复杂道路内部通达性分析方法,包括: [0005] To solve the above problems, the present invention provides a method of analysis of complex internal access roads based on the road center line, comprising:

[0006] A,获取原始地理图; [0006] A, acquires the original geographic map;

[0007] B,对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型; [0007] B, the original geographic map for the gate vector conversion processing to extract the original road model of FIG geographic;

[0008] c,提取道路模型中的道路中线; [0008] c, extracting midline road road model;

[0009] D,分别为起点及终点构建引线,其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; [0009] D, were constructed for the start and finish leads, wherein the starting point of the corresponding lead wires as a starting point, the end point is the end of the corresponding lead wire;

[0010] E,对道路中线进行空间拓扑处理以构建拓扑路径; [0010] E, the topology of the road centerline spatially processed to construct a path topology;

[0011] F,剔除多余的拓扑路径并返回步骤E,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0011] F, eliminating unnecessary topological path and returns to the step E, until a connection topology remaining path start point, end point and lead.

[0012]作为上述方案的改进,所述步骤D包括: [0012] As an improvement of the above-described embodiment, the step D comprises:

[0013] D1,分别将起点及终点偏移至道路中线上; [0013] D1, respectively, the start and end line of the road to the offset;

[0014] D2,分别以起点及终点为基准构建垂线段且都不与其他道路中线相交,其中,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线; [0014] D2, respectively, starting and ending points of reference and do not construct the perpendicular segment intersects with another road centerline, wherein said vertical section corresponding to start point as a starting point lead, the end of the corresponding vertical segments lead end;

[0015] D3,分别以起点及终点为基准切断对应道路中线。 [0015] D3, respectively, starting and ending points of the road corresponding to the cutting reference line.

[0016]作为上述方案的改进,所述步骤F包括: [0016] As an improvement of the above-described embodiment, the step F comprises:

[00 17] F1,判断步骤E中是否存在错误的拓扑路径; [00 17] F1, if there are errors in the determination in Step E topological path;

[0018] F2,若存在错误的拓扑路径,删除错误的拓扑路径,返回步骤E; [0018] F2, topology if an error path exists, delete the incorrect topology of the path, returns to step E;

[0019] F3,若不存在错误的拓扑路径,删除长度较长的拓扑路径,并返回步骤E,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0019] F3, topological path if there is an error, deleting the longer length topological path, and returns to step E, until a remaining connecting the start point, the end point of the topology and the lead path.

[0020]作为上述方案的改进,所述步骤F3包括: [0020] As an improvement of the above-described embodiment, F3 comprises the step of:

[0021] F31,判断拓扑路径中是否存在分支结点,其中,所述分支结点为除起点及终点以外的拓扑路径交点; [0021] F31, determines whether there is a branch node topology path, wherein the branch node of the path intersection topology other than a start point and an end point;

[0022] F32,若存在分支结点,检查拓扑路径中分支结点的连接线,删除长度较长的连接线,返回步骤E; [0022] F32, if the branch node, check the connection line branch topological path node, deleting the longer length of the connecting line, returns to step E is present;

[0023] F33,若不存在分支结点,且拓扑路径唯一并包含起点及终点时,则拓扑路径为起点与终点之间的通达道路。 [0023] F33, if there is a branch node, and when the sole and comprising a topological path beginning and ending, the topology for the access path between the start and end points of road.

[0024] 作为上述方案的改进,所述步骤F32包括: [0024] As an improvement of the above-described embodiment, the step F32 comprises:

[0025] F321,若存在两相邻的分支结点,则删除两相邻的分支结点的连接线中较长的连接线,返回步骤E; [0025] F321, if two adjacent branch node exists, delete the connection line between two adjacent nodes in a branch of the longer connecting lines, returns to step E;

[0026] F322,若存在唯一的分支结点,且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线,返回步骤E; [0026] F322, if only the presence of a branch node, and the topological path includes beginning and ending, and the deletion branch junction connection start or end of the longer connecting line, returns to step E;

[0027] F323,若存在唯一的分支结点,且拓扑路径中不包含起点或终点,则删除拓扑路径,返回步骤E。 [0027] F323, if only the presence of a branch node, and the topological path does not contain the start or end point, topological path is deleted, returned to step E.

[0028]相应地,本发明还提供了一种基于道路中线的复杂道路内部通达性分析系统,包括:获取模块,用于获取原始地理图;栅矢转换模块,用于对原始地理图进行栅矢转换处理, 以提取原始地理图中的道路模型;中线提取模块,用于提取道路模型中的道路中线;引线构建模块,用于分别为起点及终点构建引线,其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线;拓扑构建模块,用于对道路中线进行空间拓扑处理以构建拓扑路径; 路径剔除模块,用于剔除多余的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0028] Accordingly, the present invention also provides a complex internal access path analysis system based on the center line of a road, comprising: an obtaining module, configured to obtain the original geographic map; gate vector conversion means for the original geographic map for the gate vector conversion processing to extract the original model of the road in the geographic map; line extracting means for extracting road line of the road model; lead building blocks were used to build the lead starting and ending points, which is the starting point of the corresponding lead starting wire, the end of the corresponding lead wire end; topology constructing means for the topology of the road centerline spatially processed to construct topological path; path removed means for eliminating unnecessary topological path until a remaining connecting the start point, end point and topological path leads.

[0029]作为上述方案的改进,所述引线构建模块包括:偏移单元,用于分别将起点及终点偏移至道路中线上;垂线段单元,用于分别以起点及终点为基准构建垂线段,其中,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线;切断单元,用于分别以起点及终点为基准切断道路中线。 [0029] As an improvement of the above-described embodiment, the wire constructing module comprises: an offset means for respectively starting and ending points of the line is shifted to a road; vertical segment means for respectively starting and ending points of the reference section perpendicular Construction , wherein said vertical section corresponding to start point as a starting point lead, the end of the corresponding vertical segment end leads; cutting means for respectively starting and ending off the road center line as a reference.

[0030] 作为上述方案的改进,所述路径剔除模块包括:错误判断单元,用于判断是否存在错误的拓扑路径;第一删除单元,用于存在错误的拓扑路径时,删除错误的拓扑路径,;第二删除单元,用于不存在错误的拓扑路径时,删除长度较长的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0030] As an improvement of the above-described embodiment, the path culling module comprises: error determination means for determining whether there is an error topological path; a first deleting unit configured to, when there is an error in the topological path, delete the incorrect topological path, ; and a second deletion unit for error when topological path does not exist, deleting topological path longer length until a remaining connecting the start point, end point and topological path leads.

[0031] 作为上述方案的改进,所述第二删除单元包括:结点判断单元,用于判断拓扑路径中是否存在分支结点,其中,所述分支结点为除起点及终点以外的拓扑路径交点;第一分支处理单元,用于存在分支结点时,检查拓扑路径中分支结点的连接线,删除长度较长的连接线;第二分支处理单元,用于不存在分支结点,且拓扑路径唯一并包含起点及终点时,则设置拓扑路径为起点与终点之间的通达道路。 [0031] As an improvement of the above-described embodiment, the second deletion unit comprising: a junction judging unit, for judging whether there is a branch node topology path, wherein the Topology branch node of the path other than a start point and an end point intersection; a first branch processing means for when there is a branch node, check the topology connecting lines branching path node, deleting the longer length of the connecting line; a second branch processing means for the branch node does not exist, and topology and contains a unique path starting and ending points, set the path for the access road topology between the start and end points.

[0032] 作为上述方案的改进,所述第一分支处理单元包括:第一删除子单元,用于存在两相邻的分支结点时,则删除两相邻的分支结点的连接线中较长的连接线;第二删除子单元, 用于存在唯一的分支结点时,且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线;第三删除子单元,用于存在唯一的分支结点,且拓扑路径中不包含起点或终点时,则删除拓扑路径。 [0032] As an improvement of the above-described embodiment, the first branch processing unit comprises: a first deleting sub-unit, two adjacent nodes for the presence of a branch, the branch is deleted two adjacent nodes representing connection lines long connecting lines; second deleting sub-unit, only for the presence of a branch node, and the topological path includes beginning and ending, and the deletion branch junction connection start or end of the longer connecting line; first three subunit deleted, only for the presence of a branch node, and when the path does not contain the topology starting or ending, the topological path is deleted.

[0033]实施本发明,具有如下有益效果: [0033] The embodiment of the present invention, has the following advantages:

[0034]本发明通过将复杂道路解算扩展到空间拓扑分析领域,通过点线关系,线拓扑错误理论及定义,求解出复杂道路,因此本发明尤其适用于平面道路的通达性求解;与传统算法相比,本发明具有原理简单,易于实现,高效稳定的特点,可有效克服现有技术运算效率低、准确度低的缺陷,大大节约数据处理的难度、成本和时间,在民用及军用领域都具有巨大应用潜力。 [0034] The present invention will be complicated road resolver extended to the topological analysis of the art, by the dotted line relationship, a line topology errors theory and definitions, solving complex roads, thus the present invention is particularly accessibility Solving for flat road; a conventional compared algorithm, the principles of the present invention has a simple, easy to implement, efficient and stable, and can be effectively overcome the prior art low operation efficiency, low accuracy defects, significant savings in data processing difficulty, cost and time, in the field of civil and military They have great potential applications.

附图说明 BRIEF DESCRIPTION

[0035]图1是本发明基于道路中线的复杂道路内部通达性分析方法的第一实施流程图; [0036]图2是本发明基于道路中线的复杂道路内部通达性分析方法的第二实施流程图; [0037]图3是本发明基于道路中线的复杂道路内部通达性分析方法的第三实施流程图; [0038]图4是本发明中的原始地理图; [0035] FIG. 1 is based on the first embodiment of the analysis method accessibility complex internal Roads flowchart midline of the present invention; [0036] FIG. 2 is based on the midline of the complex internal Roads accessibility analysis method of the second embodiment of the process of the present invention FIG; [0037] FIG. 3 is a flowchart illustrating a third embodiment of the midline of the complex internal roads access analysis method of the present invention; [0038] FIG. 4 is a geographic map of the original invention;

[0039]图5是本发明中的道路模型图; [0039] FIG 5 is a model diagram of a road according to the present invention;

[0040]图6是本发明中的道路中线图; [0040] FIG. 6 is a line drawing of a road present invention;

[0041]图7是本发明中的引线示意图; [0041] FIG. 7 is a schematic view of a lead according to the present invention;

[0042]图8是本发明中的拓扑路径图; [0042] FIG. 8 is a topology of the present invention in FIG path;

[0043]图9是本发明中的另一拓扑路径图; [0043] FIG. 9 is another topological path in the present invention, FIG;

[0044]图1〇是本发明中的又一拓扑路径图; [0044] FIG 1〇 topological path is another of the present invention in FIG;

[0045]图11是本发明中的通达路径图; [0045] FIG. 11 is an access path in the present invention, FIG;

[0046]图12是本发明基于道路中线的复杂道路内部通达性分析系统的结构示意图; [0046] FIG. 12 is a schematic view of the present invention is based on the complex internal structure of the access line Roads analysis system;

[0047]图13是本发明中引线构建模块的结构示意图; [0047] FIG. 13 is a structural diagram of the present invention, the lead module constructed;

[0048]图14是本发明中路径剔除模块的结构示意图; [0048] FIG. 14 is a structural diagram of the present invention, the path of the removed module;

[0049]图15是本发明中第一删除模块的结构示意图; [0049] FIG. 15 is a schematic diagram of a first deleting module structure of the present invention;

[0050] 图16是本发明中第一分支处理单元的结构示意图; [0050] FIG. 16 is a schematic view of the present invention, the first branch processing unit;

[0051] 图中各部分序号如下: [0051] FIG part number of each as follows:

[0052]点A为起点,点B为终点,引线C为起点引线,引线D为终点引线,虚线E为错误的拓扑路径,实线F即为通达路径。 [0052] The starting point A, point B is the end point, C is a starting point lead wire, the lead wire D as the end point, a broken line E is a topological path error, a solid line F is the access path.

具体实施方式 Detailed ways

[0053]为使本发明的目的、技术方案和优点更加清楚,下面将结合附图对本发明作进一步地详细描述。 [0053] To make the objectives, technical solutions, and advantages of the present invention will become apparent in conjunction with the accompanying drawings below of the present invention will be described in further detail. 仅此声明,本发明在文中出现或即将出现的上、下、左、右、前、后、内、外等方位用词,仅以本发明的附图为基准,其并不是对本发明的具体限定。 Only this statement, the present invention particularly the present invention appear in the text or on the upcoming, lower, left, right, front, rear, inner and outer orientations other words, the present invention only with reference to the accompanying drawings, which are not limited.

[0054]参见图1,图1显示了本发明基于道路中线的复杂道路内部通达性分析方法的第一实施例流程图,其包括: [0054] Referring to FIG. 1, FIG. 1 shows a flowchart of a first embodiment based on the analysis of complex internal accessibility Roads midline of the present invention, which comprises:

[0055] S101,获取原始地理图(参见图4); [0055] S101, acquires the original geographic map (see FIG. 4);

[0056] S102,对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型(参见图5); [0056] S102, the original gate geographic map for vector conversion processing to extract the original road model geographic map (see FIG. 5);

[0057]需要说明的是,对原始地理图进行栅矢转换处理后,可快速地隐藏原始地理图中的无关信息(如,植被、建筑物等),从而提取出准确的道路模型。 [0057] Incidentally, the original geographic map vector conversion processing for the gate, can be quickly hide irrelevant information (e.g., vegetation, buildings, etc.) in the geographic map of the original, thereby extracting accurate road model.

[0058] S103,提取道路模型中的道路中线(参见图6); [0058] S103, the road extraction line (see FIG. 6) of the road model;

[0059]需要说明的是,步骤S102中所提取的道路模型具有宽度信息,可直接反应道路的实际宽度;但是,在构建路径时不需要掌握道路的实际宽度,因此,本本方法通过提取道路模型中各道路中线的方式,将含宽度信息的道路模型简化为不含宽度信息的线段。 [0059] Incidentally, in step S102 a road model has a width information extracted directly reflect the actual width of the road; however, when building the path need not grasp the actual width of the road, therefore, a method by extracting the road model books each line in the road way, the model with the road width information is reduced to free the line width information.

[0060] S104,分别为起点及终点构建引线(参见图7); [0060] S104, the leads were constructed (see FIG. 7) as a starting point and an end point;

[0061]其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; [0061] wherein the starting point of the corresponding lead wires as a starting point, the end point is the end of the corresponding lead wire;

[0062] 具体地,所述步骤S104包括: [0062] Specifically, the step S104 comprises:

[0063] ⑴分别将起点及终点偏移至道路中线上。 [0063] ⑴ respectively shifted to the start and end line of the road.

[0064]例如,当起点不在道路中线上时,查找出道路中线上与起点距离最近的点,并把该点设置为起点,从而实现起点的偏移;当起点在道路中线上时,则不需要进行偏移处理。 [0064] For example, when the starting point is not in the line of the road, the road to find the starting point of the line and the closest point, and the point is set as the starting point, in order to achieve the offset origin; when the starting line of the road, is not offset processing is required. [0065] ⑵分别以起点及终点为基准构建垂线段。 [0065] ⑵ respectively start and end segments perpendicular to the reference construct.

[0066]需要说明的是,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线。 [0066] Incidentally, the starting point of a perpendicular line segment corresponding starting wire, the end segments perpendicular to the corresponding wire end. 同时,所述垂线段仅与起点或终点相交,但不与其他道路中线相交。 Meanwhile, the vertical line segment intersect only the start or end point, but does not intersect with another road centerline.

[0067] ⑶分别以起点及终点为基准切断道路中线。 [0067] ⑶ respectively to start and finish off the road as a reference center line.

[0068] S105,对道路中线进行空间拓扑处理以构建拓扑路径; [0068] S105, the topology of the road centerline spatially processed to construct a path topology;

[0069] S106,剔除多余的拓扑路径并返回步骤Sl〇5,直到仅剩一条连接起点、终点及引线的拓扑路径(参见图8〜11)。 [0069] S106, eliminating unnecessary topological path and returns to step Sl〇5, until a connection topology remaining path start point, end point and the leads (see FIG. 8~11).

[0070]需要说明的是,所述多余的拓扑路径包括错误的拓扑路径及重复的拓扑路径等, 但不以此为限制,只要不是起点与终点之间的最短路径即为多余的拓扑路径。 [0070] Incidentally, the redundant path comprises topology topological path error and repeating topological path, etc., but is not limited thereto, as long as the shortest path between start and end points that is not redundant topological path. 经步骤S101 〜S106处理后,剩下的唯一一条拓扑路径即为起点与终点之间的通达路径(参见图11)。 After step S101 ~S106 process, the only remaining one topological path is the access path (see FIG. 11) between the beginning and the end. [0071]参见图2,图2显示了本发明基于道路中线的复杂道路内部通达性分析方法的第二实施例流程图,其包括: [0071] Referring to FIG. 2, FIG. 2 shows a second embodiment flow chart illustrating a method based on analysis of complex internal accessibility of Roads midline of the present invention, which comprises:

[0072] S201,获取原始地理图(参见图4); [0072] S201, acquires the original geographic map (see FIG. 4);

[0073] S202,对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型(参见图5); [0073] S202, the original gate geographic map for vector conversion processing to extract the original road model geographic map (see FIG. 5);

[0074] S203,提取道路模型中的道路中线(参见图6); [0074] S203, the road extraction line (see FIG. 6) of the road model;

[0075] S204,分别为起点及终点构建引线(参见图7);其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; [0075] S204, the leads were constructed (see FIG. 7) as a starting point and an end point; wherein the starting point of the corresponding lead wires as a starting point, the end point is the end of the corresponding lead wire;

[0076] 具体地,所述步骤S204包括: [0076] Specifically, the step S204 comprises:

[0077] ⑴分别将起点及终点偏移至道路中线上。 [0077] ⑴ respectively shifted to the start and end line of the road.

[0078] ⑵分别以起点及终点为基准构建垂线段。 [0078] ⑵ respectively start and end segments perpendicular to the reference construct.

[0079] ⑶分别以起点及终点为基准切断道路中线。 [0079] ⑶ respectively to start and finish off the road as a reference center line.

[0080] S205,对道路中线进行空间拓扑处理以构建拓扑路径(参见图8); [0080] S205, the topology of the road centerline spatially processed to construct topological path (see FIG. 8);

[0081] S206,判断步骤S205中是否存在错误的拓扑路径; [0081] S206, step S205 determines whether there is an error in the topological path;

[0082]需要说明的是,步骤S2〇5中在构建拓扑路径时,可记录错误的拓扑路径(参见图8 中的虚线),所述错误的拓扑路径是指无法连通起点及终点路径。 [0082] Incidentally, when constructing step S2〇5 topological path, the error may be recorded topological path (see dotted line in FIG. 8), the error is not communicated topological path refers to the path start point and end point.

[0083] S207,若存在错误的拓扑路径,删除错误的拓扑路径(参见图8、9),返回步骤82〇5; [0083] S207, topology if an error path exists, delete the incorrect path topology (see FIG. 8,9), returns to step 82〇5;

[0084] S208,若不存在错误的拓扑路径,删除长度较长的拓扑路径(参见图1〇),并返回步骤S205,直到仅剩一条连接起点、终点及引线的拓扑路径(参见图n)。 [0084] S208, if there is an error in the path topology, topological path length longer deleted (see FIG 1〇), and returns to step S205, until the starting point to the remaining one, and the lead end of the path topology (see FIG. N) .

[0085]需要说明的是,长度较长的拓扑路径是指当两条路径均能连接起点及终点时,长度较长的一条路径即为长度较长的拓扑路径。 [0085] Incidentally, the longer length refers to the topological path is connected when the two paths can start and end, the length of the longer path length that is longer topological path. 相应地,经步骤S201〜S2〇8处理后,剩下的唯一一条拓扑路径即为起点与终点之间的通达路径。 Accordingly, after step S201~S2〇8 process, the only remaining access a topological path is the path between the start and end points.

[0086]参见图3,图3显示了本发明基于道路中线的复杂道路内部通达性分析方法的第三实施例流程图,其包括: > [0086] Referring to FIG. 3, FIG. 3 shows a third embodiment of the present invention is based on the analysis of the accessibility of complex internal Roads flowchart line, comprising:>

[0087] S301,获取原始地理图(参见图4); [0087] S301, acquires the original geographic map (see FIG. 4);

[0088] S302,对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型(参见图5); [0088] S302, the original gate geographic map for vector conversion processing to extract the original road model geographic map (see FIG. 5);

[0089] S303,提取道路模型中的道路中线(参见图6); [0089] S303, the road extraction line (see FIG. 6) of the road model;

[0090] S304,分别为起点及终点构建引线(参见图7);其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; [0090] S304, the leads were constructed (see FIG. 7) as a starting point and an end point; wherein the starting point of the corresponding lead wires as a starting point, the end point is the end of the corresponding lead wire;

[0091] 具体地,所述步骤S304包括: [0091] Specifically, the step S304 comprises:

[0092] (1)分别将起点及终点偏移至道路中线上。 [0092] (1) respectively the start and end of the line is shifted to the road.

[0093] ⑵分别以起点及终点为基准构建垂线段。 [0093] ⑵ respectively start and end segments perpendicular to the reference construct.

[0094] ⑶分别以起点及终点为基准切断道路中线。 [0094] ⑶ respectively to start and finish off the road as a reference center line.

[0095] S3〇5,对道路中线进行空间拓扑处理以构建拓扑路径(参见图8); [0095] S3〇5, the topology of the road centerline spatially processed to construct topological path (see FIG. 8);

[0096] S306,判断步骤S305中是否存在错误的拓扑路径; [0096] S306, step S305 determines whether there is an error in the topological path;

[0097]需要说明的是,步骤S305中在构建拓扑路径时,可记录错误的拓扑路径,所述错误的拓扑路径是指无法连通起点及终点路径。 [0097] Incidentally, in step S305 in the construction of the path topology, the topology can record the error path, the error is not communicated topological path refers to the path start point and end point.

[0098] S307,若存在错误的拓扑路径,删除错误的拓扑路径(参见图8、9中的虚线),返回步骤S305; [0098] S307, topology if an error path exists, delete the incorrect topology of the path (see dashed line in FIG. 8, 9), returns to step S305;

[0099] S308,若不存在错误的拓扑路径,则判断拓扑路径中是否存在分支结点。 [0099] S308, if there is an error topological path, it is determined whether there is a branch node topology path.

[0100]其中,所述分支结点为除起点及终点以外的拓扑路径交点; S3〇9,若存在分支结点,检查拓扑路径中分支结点的连接线,删除长度较长的连接线(参见图10),返回步骤S305; [0100] wherein, the node is a branch other than the topological intersection of the path start point and end point; S3〇9, if the connection line branch node, check the topological path branch node is present, remove the longer length of the connection line ( Referring to FIG. 10), returns to step S305;

[0102] 具体地,所述步骤S309包括: [0102] Specifically, the step S309 comprises:

[0103] ⑴若存在两相邻的分支结点渗见图10中的点m及点n),则删除两相邻的分支结点的连接线中较长的连接线,返回步骤S305; [0103] ⑴ if there are two adjacent nodes branching retentate see point m and point n. 10), the connection line is deleted two adjacent nodes in the longer branch cable, returns to step S305;

[0104] (2)若存在唯一的分支结点(即拓扑路径中存在闭合道路,参见图10中的点〇),且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线(参见图10中的点〇右侧的闭合路径),返回步骤S305; [0104] (2) If only the branch node is present (i.e. the presence of a closed road topology path, see point square in FIG. 10), and the topology path includes start point and end point, delete the branch node and the start or end point the longer connection cable (see FIG closed path to the right of point 10 billion), returns to step S305;

[0105] (3)若存在唯一的分支结点,且拓扑路径中不包含起点或终点,则删除拓扑路径(即删除闭合道路),返回步骤S305。 [0105] (3) only if the presence of a branch node, and the topological path does not contain the start or end point, topological path is deleted (i.e., closed roads deleted), returns to step S305.

[0106] S310,若不存在分支结点,且拓扑路径唯一并包含起点及终点时,则拓扑路径为起点与终点之间的通达道路。 [0106] S310, if there is a branch node, and when the sole and comprising a topological path beginning and ending, the topology for the access path between the start and end points of road.

[0107]由上可知,本发明通过将复杂道路解算扩展到空间拓扑分析领域,通过点线关系, 线拓扑错误理论及定义,求解出复杂道路,因此本发明尤其适用于平面道路的通达性求解; 与传统算法相比,本发明具有原理简单,易于实现,高效稳定的特点,可有效克服现有技术运算效率低、准确度低的缺陷,大大节约数据处理的难度、成本和时间,在民用及军用领域都具有巨大应用潜力。 [0107] From the above, the present invention is by a complex road resolver extended to the topological analysis of the art, by the dotted line relationship, a line topology errors theory and definitions, solving complex roads, thus the present invention is particularly suitable for the accessibility of the plane of the road solving; compared with the conventional algorithm, the principles of the present invention has a simple, easy to implement, efficient and stable, and can be effectively overcome the prior art low operation efficiency, low accuracy defects, significant savings in data processing difficulty, cost and time, in civil and military fields has great potential applications.

[0108] 参见图12,图12显示了本发明基于道路中线的复杂道路内部通达性分析系统1〇〇的具体结构,其包括: [0108] Referring to FIG. 12, FIG. 12 shows a specific structure of the road based on the center line of the complex internal access road 1〇〇 analysis system of the present invention, which comprises:

[0109] 获取模块1,用于获取原始地理图; [0109] an acquiring module, for acquiring the original geographic map;

[0110] 栅矢转换模块2,用于对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型; [0110] The gate vector conversion module 2, is used for the original geographic FIG gate vector conversion processing to extract the original road model of FIG geographic;

[0111] 中线提取模块3,用于提取道路模型中的道路中线; [0111] 3 midline extraction module configured to extract the road center line of a road model;

[0112]引线构建模块4,用于分别为起点及终点构建引线。 [0112] building blocks leads 4, respectively, for the start and finish leads are constructed. 其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线。 Wherein the starting point of the corresponding lead wires as a starting point, the end point is the end of the corresponding lead wire.

[0113] 拓扑构建模块5,用于对道路中线进行空间拓扑处理以构建拓扑路径; [0113] Building topology module 5 for road centerline spatially processed to construct topology topological path;

[0114]路径剔除模块6,用于剔除多余的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0114] Path remove module 6, for eliminating unnecessary topological path until a connection topology remaining path start point, end point and lead.

[0115]工作时,获取模块1获取原始地理图;栅矢转换模块2对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型;中线提取模块3提取道路模型中的道路中线;引线构建模块4分别为起点及终点构建引线。 When the [0115] work, acquiring module 1 acquires the original geographic map; gate vector conversion module 2 to the original geographic map for the gate vector conversion processing to extract the road model original geographic figure; road centerline line extraction module 3 extracts the road model ; building blocks leads 4 were constructed for the start and finish leads. 拓扑构建模块5对道路中线进行空间拓扑处理以构建拓扑路径;路径剔除模块6剔除多余的拓扑路径后,通过拓扑构建模块5再次对道路中线进行空间拓扑处理以构建拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 5 topological road centerline building blocks spatially processed to construct topology topological path; reject path module 6 excluding redundant path topology, the topology of the road centerline module 5 again performs spatial processing to construct topology topological path construction, until the remaining one connector the starting point and end point of the topological path leads.

[0116]如图13所示,所述引线构建模块4包括: [0116] 13, the lead 4 building blocks comprising:

[0117]偏移单元41,用于分别将起点及终点偏移至道路中线上; [0117] shift unit 41, respectively, for the start and end of the line is shifted to the road;

[0118]垂线段单元42,用于分别以起点及终点为基准构建垂线段。 [0118] vertical section unit 42, respectively starting and ending points for the reference segment constructed perpendicular. 其中,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线。 Wherein the start point as a starting point corresponding to section perpendicular leads, said end point corresponding to the end of vertical wire segments.

[0119]切断单元43,用于分别以起点及终点为基准切断道路中线。 [0119] cutting unit 43, respectively, for the start and end off the road center line as a reference.

[0120]需说明的是,引线构建模块4为起点及终点构建引线过程中,首先通过该偏移单元41分别将起点及终点偏移至道路中线上,其次通过垂线段单元42分别以起点及终点为基准构建垂线段,最后通过切断单元43分别以起点及终点为基准切断道路中线。 [0120] It is noted that the lead wire constructed building block 4 during starting and the end point, the start point and first end 41 are offset by the path to the line shifting unit, followed by a vertical line segment and a starting point unit 42 respectively segment constructed perpendicular to the reference end, and finally through the cutting unit 43 to start and end, respectively, off the road center line as a reference.

[0121 ]如图14所示,所述路径剔除模块6包括: [0121] As shown in FIG. 14, the path 6 culling module comprises:

[0122]错误判断单兀61,用于判断是否存在错误的拓扑路径; [0122] 61 Wu single error determination, for determining whether there is an error topological path;

[0123]第一删除单元62,用于存在错误的拓扑路径时,删除错误的拓扑路径,; When [0123] the first deletion unit 62, a topology path for the presence of errors, remove the incorrect topology path;

[0124]第一删除单兀63,用于不存在错误的拓扑路径时,删除长度较长的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0124] 63 first remove single Wu, when topology for error path does not exist, deleting topological path longer length until a remaining connecting the start point, end point and topological path leads.

[0125]需要说明的是,路径剔除模块6剔除多余的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径的过程包括:通过错误判断单元61判断是否存在错误的拓扑路径;若存在错误的拓扑路径时,则通过第一删除单元62删除错误的拓扑路径,并通过拓扑构建模块5再次对道路中线进行空间拓扑处理以构建拓扑路径;若不存在错误的拓扑路径时,则通过第二删除单元63删除长度较长的拓扑路径,并通过拓扑构建模块5再次对道路中线进行空间拓扑处理以构建拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 [0125] Incidentally, the path cull module 6 eliminating unnecessary topological path until a remaining connecting the start point, the end point of the topology and the lead path includes: if there are errors topological path through the error determination unit 61 determines; if there error topological path, through a first deletion unit 62 to delete the wrong path topology, the topology building blocks and road centerline 5 again spatially processed to construct topology topological path; if there is an error when the topological path, through a first two deletion unit 63 to delete the path longer length topology, the topology building blocks and road centerline 5 again performs spatial processing to construct topology topological path until a remaining connecting the start point, end point and topological path leads.

[0126] 如图15所示,所述第二删除单元63包括: [0126] As shown in FIG 15, the second deletion unit 63 comprises:

[0127] 结点判断单元631,用于判断拓扑路径中是否存在分支结点,其中,所述分支结点为除起点及终点以外的拓扑路径交点; [0127] node determination unit 631, for determining whether there is a branch node topology path, wherein the branch node of the path intersection topology other than a start point and an end point;

[0128] 第一分支处理单元632,用于存在分支结点时,检查拓扑路径中分支结点的连接线,删除长度较长的连接线; [0128] The first branch processing unit 632, for the presence of a branch node, check the topology connecting lines branching path node, deleting the longer length of the connection line;

[0129] 第二分支处理单元633,用于不存在分支结点,且拓扑路径唯一并包含起点及终点时,则设置拓扑路径为起点与终点之间的通达道路。 [0129] The second branch processing unit 633, for the branch node does not exist, and when the topology of the path and contains the only starting and ending points, is set as the access road topological path between the start and end points.

[0130] 需要说明的是,第二删除单元63删除长度较长的拓扑路径的过程包括:通过结点判断单元631判断拓扑路径中是否存在分支结点;若存在分支结点时,第一分支处理单元632检查拓扑路径中分支结点的连接线,删除长度较长的连接线,并通过拓扑构建模块5再次对道路中线进行空间拓扑处理以构建拓扑路径;若不存在分支结点且拓扑路径唯一并包含起点及终点时,第二分支处理单元633将该拓扑路径设置为起点与终点之间的通达道路。 [0130] Incidentally, the process of the longer length of the second deletion unit 63 to delete the path topology comprising: determining whether there is a branch node in the path through the node topology determination unit 631; if a branch node is present, the first branch the processing unit 632 checks the topology connecting lines branching path node, deleting the longer length of the connecting lines and topology building blocks road centerline 5 again performs spatial processing to construct topology topological path; if there is a branch node and the topological path the only and includes start and end, the second branch processing unit 633 access to a road topological path between start and end points.

[0131] 如图16所示,所述第一分支处理单元632包括: [0131] As shown in FIG. 16, the first branch processing unit 632 comprises:

[0132] 第一删除子单元6321,用于存在两相邻的分支结点时,则删除两相邻的分支结点的连接线中较长的连接线; When the [0132] first deleting sub-unit 6321, two adjacent nodes for branch exists, delete the connection line between two adjacent nodes in a branch of the longer connecting line;

[0133] 第二删除子单元6322,用于存在唯一的分支结点时,且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线; [0133] The second sub-unit 6322 to delete, when there is a unique branch for the node, and the topological path includes beginning and ending, and the deletion branch junction connection start or end of the longer connecting line;

[0134] 第三删除子单元6323,用于存在唯一的分支结点,且拓扑路径中不包含起点或终点时,则删除拓扑路径。 When the [0134] third deletion sub-unit 6323, only for the presence of a branch node, and the topological path does not contain the start or end point, topological path is deleted.

[0135] 具体地,第一分支处理单元632的处理过程包括:若存在两相邻的分支结点时,第一删除子单元6321删除两相邻的分支结点的连接线中较长的连接线;若存在唯一的分支结点时且拓扑路径中包含起点及终点时,第二删除子单元6322删除分支结点与起点或终点的连线中较长的连接线;若存在唯一的分支结点,且拓扑路径中不包含起点或终点时,第三删除子单元6323删除拓扑路径。 [0135] Specifically, the first processing branch processing unit 632 comprises: if two adjacent branch node is present, delete the first sub-unit 6321 to delete the connection line between two adjacent nodes in a branch longer connection line; if only when the branch node is present and contains the topological path starting and ending points, and the deletion branch node connection start or end of the second sub-unit 6322 to delete the longer connecting line; if there is a unique branch junction when point and topological path does not contain the start or end point, a third sub-unit 6323 remove remove topological path.

[0136] 需要说明的是,本发明可运行于Windows 7操作系统上,具有原理简单,易于实现, 高效稳定的特点,可有效克服现有技术运算效率低、准确度低的缺陷,大大节约数据处理的难度、成本和时间,在民用及军用领域都具有巨大应用潜力。 [0136] Incidentally, the present invention may be run on Windows 7 operating system, has simple, easy to implement, efficient and stable, and can be effectively overcome the prior art low operation efficiency, low accuracy defects, significant savings in data the difficulty of treatment, cost and time, in both civil and military fields has great potential applications.

[0137] 以上所述是本发明的优选实施方式,应当指出,对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可以做出若干改进和润饰,这些改进和润饰也视为本发明的保护范围。 [0137] The above embodiment is a preferred embodiment of the present invention, it should be noted that those of ordinary skill in the art who, without departing from the principles of the present invention, can make various improvements and modifications, such modifications and retouch protection scope of the present invention.

Claims (10)

1.一种基于道路中线的复杂道路内部通达性分析方法,其特征在于,包括: A,获取原始地理图; B,对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型. C,提取道路模型中的道路中线; ' D,分别为起点及终点构建引线,其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; E,对道路中线进行空间拓扑处理以构建拓扑路径; F,剔除多余的拓扑路径并返回步骤E,直到仅剩一条连接起点、终点及引线的拓扑路径。 A complex internal access analysis method based on Roads line, characterized in that it comprises: A, acquires the original geographic map; B, geographic map for the original gate vector conversion processing to extract the original road model in the geography of FIG. . C, extracted road centerline road model; 'D, were constructed leads as a starting point and an end point, wherein the starting point of the corresponding lead starting wire, the end of the corresponding lead to the end of the lead; E, road centerline spatial topology process to construct a path topology; F, eliminating unnecessary topological path and returns to the step E, until a connection topology remaining path start point, end point and lead.
2.如权利要求1所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述步骤D包括: D1,分别将起点及终点偏移至道路中线上; D 2,分别以起点及终点为基准构建垂线段,其中,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线且都不与其他道路中线相交; D3,分别以起点及终点为基准切断对应的道路中线。 2. Based on internal complexity accessibility Roads midline method according to claim 1, wherein the step D comprises: D1, respectively, the start and end line of the road to the offset; D 2, respectively, start and end of the reference segment constructed perpendicular, wherein said vertical line segment corresponding to the start point as a starting point lead, the end of the corresponding vertical segment and the end of the lead line does not intersect with other roads; D3, respectively, starting and ending as a reference corresponding cut road centerline.
3.如权利要求1所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述步骤F包括: F1,判断步骤E中是否存在错误的拓扑路径; F2,若存在错误的拓扑路径,删除错误的拓扑路径,返回步骤E; F3,若不存在错误的拓扑路径,删除长度较长的拓扑路径,并返回步骤E,直到仅剩一条连接起点、终点及引线的拓扑路径。 3. Analysis of internal complexity accessibility Roads midline method according to claim 1, characterized in that said step F comprises: F1, judging whether there is an error topological path step E; F2 of, if there is an error topological path, delete the incorrect topology of the path, returns to step E; F3, topological path if there is an error, deleting the longer length topological path, and returns to step E, until a remaining connecting the start point, the end point of the topology and the lead path.
4.如权利要求3所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述步骤F3包括: F31,判断拓扑路径中是否存在分支结点,其中,所述分支结点为除起点及终点以外的拓扑路径交点; F32,若存在分支结点,检查拓扑路径中分支结点的连接线,删除长度较长的连接线,返回步骤E; F33,若不存在分支结点,且拓扑路径唯一并包含起点及终点时,则拓扑路径为起点与终点之间的通达道路。 4. Accessibility Analysis internal complexity Roads midline method according to claim 3, wherein said step F3 comprises: F31, determines whether there is a branch node topology path, wherein the branch node in addition to the topology of the intersection outside the path start and end; F32, if the connection line branch node, topology check node branch path exists, deleting the longer length cables, returns to step E; F33, if there is a branch node , and when the only path topology and includes start and finish, the topology path access road between the start and end points.
5.如权利要求4所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述步骤F32包括: F321,若存在两相邻的分支结点,则删除两相邻的分支结点的连接线中较长的连接线, 返回步骤E; F322,若存在唯一的分支结点,且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线,返回步骤E; F323,若存在唯一的分支结点,且拓扑路径中不包含起点或终点,则删除拓扑路径,返回步骤E。 Branch F321, if two adjacent branch node is present, the two adjacent deleted: 5. Based Accessibility internal complexity Roads midline method according to claim 4, wherein said step F32 comprises cable junction longer cable, returns to step E; F322, if only the presence of a branch node, and the topological path includes beginning and ending, and the deletion branch junction connection start or end of a longer connection lines, returns to step E; F323, if only the presence of a branch node, and the topological path does not contain the start or end point, topological path is deleted, returned to step E.
6.—种基于道路中线的复杂道路内部通达性分析系统,其特征在于,包括: 获取模块,用于获取原始地理图; 栅矢转换模块,用于对原始地理图进行栅矢转换处理,以提取原始地理图中的道路模型; 中线提取模块,用于提取道路模型中的道路中线; 引线构建模块,用于分别为起点及终点构建引线,其中,起点所对应的引线为起点引线,终点所对应的引线为终点引线; M 拓扑构建模块,用于对道路中线进行空间拓扑处理以构建拓扑路径; 路径剔除块,用于剔除多余的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 6.- species complex internal access road analysis system based on the road line, characterized by comprising: an obtaining module, configured to obtain the original geographic map; gate vector conversion means for the original geographic diagrams gate vector conversion processing extraction of the road models in the original geographic map; line extracting means for extracting road line of the road model; lead building blocks were constructed for start and end of the lead, wherein the starting point of the corresponding lead wires as a starting point, the end point corresponding to the end of the lead wire; M topology constructing means for the topology of the road centerline spatially processed to construct topological path; path excluding block topological path for eliminating unnecessary until a remaining connecting the start point, the end point of the topology and the lead path.
7.如权利要求6所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述引线构建模块包括: 偏移单元,用于分别将起点及终点偏移至道路中线上; 垂线段单兀,用于分别以起点及终点为基准构建垂线段,其中,所述起点所对应的垂线段为起点引线,所述终点所对应的垂线段为终点引线; 切断单元,用于分别以起点及终点为基准切断道路中线。 7. The complex of claim 6 of the internal line Roads analysis based access, wherein the lead building blocks comprising: a shifting unit, respectively, for the start and end of the line is shifted to the road; Wu single vertical section, respectively for the start and end of the reference segment constructed perpendicular, wherein said vertical line segment corresponding to the start point as a starting point lead, the end of the corresponding vertical segment end leads; cutting unit, respectively, for to start and finish off the road as a reference center line.
8.如权利要求6所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述路径剔除模块包括: 错误判断单元,用于判断是否存在错误的拓扑路径; 第一删除单元,用于存在错误的拓扑路径时,删除错误的拓扑路径,; 第二删除单元,用于不存在错误的拓扑路径时,删除长度较长的拓扑路径,直到仅剩一条连接起点、终点及引线的拓扑路径。 8. Analysis of internal complexity accessibility Roads midline method according to claim 6, wherein said path culling module comprises: error determination means for determining whether there is an error topological path; a first deleting unit for topological path when error is present, delete the incorrect topology path; a second deletion unit for error topological path does not exist, deleting topological path longer length until a remaining connecting the start point, end point and the wire the topological path.
9. 如权利要求8所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于,所述第二删除单元包括: 结点判断单元,用于判断拓扑路径中是否存在分支结点,其中,所述分支结点为除起点及终点以外的拓扑路径交点; 第一分支处理单元,用于存在分支结点时,检查拓扑路径中分支结点的连接线,删除长度较长的连接线; 第二分支处理单元,用于不存在分支结点,且拓扑路径唯一并包含起点及终点时,则设置拓扑路径为起点与终点之间的通达道路。 9. Analysis of internal complexity accessibility Roads midline method according to claim 8, wherein said second deleting unit comprising: a junction judging means for judging whether or not there is a branch node topology path, wherein said branching nodes other than the topological intersection of the path start point and end point; a first branch processing means for when there is a branch node, the node connected to the branch lines to check topology path length of the longer connecting line deleted ; second branch processing means for the branch node does not exist, and the only path topology and includes starting and ending points, is set as the access road topological path between the start and end points.
10. 如权利要求9所述的基于道路中线的复杂道路内部通达性分析方法,其特征在于, 所述第一分支处理单元包括: 第一删除子单元,用于存在两相邻的分支结点时,则删除两相邻的分支结点的连接线中较长的连接线; 第二删除子单元,用于存在唯一的分支结点时,且拓扑路径中包含起点及终点,则删除分支结点与起点或终点的连线中较长的连接线; 第三删除子单元,用于存在唯一的分支结点,且拓扑路径中不包含起点或终点时,则删除拓扑路径。 As claimed in claim 9 complex internal Roads midline analysis based access, wherein the first branch processing unit comprises: a first deleting sub-unit, the two adjacent branches of the node for the presence of when the connection line is deleted two adjacent nodes in the longer branch of the connecting line; deleting the second sub-unit, only for the presence of a branch node, and the topological path includes beginning and ending, the deletion branch junction connection point and the start or end of a long cable; deleting the third sub-unit, only for the presence of a branch node, and the topological path does not contain the start or end point, topological path is deleted.
CN201810297842.6A 2018-04-03 2018-04-03 Complex road interior accessibility analysis method and system based on road centerline CN108628952A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810297842.6A CN108628952A (en) 2018-04-03 2018-04-03 Complex road interior accessibility analysis method and system based on road centerline

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810297842.6A CN108628952A (en) 2018-04-03 2018-04-03 Complex road interior accessibility analysis method and system based on road centerline

Publications (1)

Publication Number Publication Date
CN108628952A true CN108628952A (en) 2018-10-09

Family

ID=63705007

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810297842.6A CN108628952A (en) 2018-04-03 2018-04-03 Complex road interior accessibility analysis method and system based on road centerline

Country Status (1)

Country Link
CN (1) CN108628952A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102280826A (en) * 2011-07-30 2011-12-14 山东鲁能智能技术有限公司 Substation intelligent robot inspection system and inspection methods
CN105160089A (en) * 2015-08-26 2015-12-16 华南理工大学 Assisted planning and site selection method for network optimization based on space syntax
CN105893961A (en) * 2016-03-30 2016-08-24 广东中冶地理信息股份有限公司 Method for extracting road center line
WO2017035380A1 (en) * 2015-08-25 2017-03-02 Ryskamp Innovations, LLC Systems and methods for machine learning
CN107423360A (en) * 2017-06-19 2017-12-01 广东中冶地理信息股份有限公司 Maze solution method based on path midline

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102280826A (en) * 2011-07-30 2011-12-14 山东鲁能智能技术有限公司 Substation intelligent robot inspection system and inspection methods
WO2017035380A1 (en) * 2015-08-25 2017-03-02 Ryskamp Innovations, LLC Systems and methods for machine learning
CN105160089A (en) * 2015-08-26 2015-12-16 华南理工大学 Assisted planning and site selection method for network optimization based on space syntax
CN105893961A (en) * 2016-03-30 2016-08-24 广东中冶地理信息股份有限公司 Method for extracting road center line
CN107423360A (en) * 2017-06-19 2017-12-01 广东中冶地理信息股份有限公司 Maze solution method based on path midline

Similar Documents

Publication Publication Date Title
Birol et al. Assembling the 20 Gb white spruce (Picea glauca) genome from whole-genome shotgun sequencing data
Rothfarb et al. Optimal design of offshore natural-gas pipeline systems
Turner From axial to road-centre lines: a new representation for space syntax and a new model of route choice for transport network analysis
Jagadeesh et al. Heuristic techniques for accelerating hierarchical routing on road networks
JP4673530B2 (en) Root detection method and route detection device from the starting point to the destination
KR100339763B1 (en) Map database device
US7877203B2 (en) Map information processing apparatus and storage medium of map information
EP0702208A2 (en) Method and system of route selection
CN100529668C (en) Iterative logical renewal of navigable map database
US20060003823A1 (en) Dynamic player groups for interest management in multi-character virtual environments
CN101514904B (en) Position information transmitting and receiving, and target road segment identifying method and device
JP4695830B2 (en) Moving body area map providing apparatus
US20050058155A1 (en) Data structure of map data, map data storage medium, map data updating method and map data processing apparatus
Zheng et al. Finding obstacle-avoiding shortest paths using implicit connection graphs
WO1989006414A1 (en) Route search method for navigation system
JPWO2005093372A1 (en) Navigation device and route guidance method
Dean Finding optimal routes for networks of harvest site access roads using GIS-based techniques
CN1294405C (en) Method for transmitting position information of digital map
CN1938562A (en) Pathfinding system
JPH10122887A (en) Navigator
CN1853086B (en) Vehicle information terminal, wherein the path extraction means, path A display method
US8275546B2 (en) Travelogue-based travel route planning
JP2001215130A (en) Automatic producer of road guide for pedestrian, its method and recording medium
KR20060045469A (en) Navigation apparatus, data processing method and computer program used therewith
RU2006143654A (en) path analysis system

Legal Events

Date Code Title Description
PB01 Publication
SE01 Entry into force of request for substantive examination