首页> 外国专利> Method for producing a directory of road segments, a method for determining of all road segments within a search area and computer program

Method for producing a directory of road segments, a method for determining of all road segments within a search area and computer program

机译:产生路段目录的方法,确定搜索区域内所有路段的方法和计算机程序

摘要

A method is presented, with which a directory of road segments (2) of a digital road map (1, 6a to c) for a navigation system, particularly simple and effective. The directory in this case receives the data structure of an ordered n - tree, in which the road segments (2) are stored in node. The method has the following steps:a) assigning a geographic position relative to each of the road segments (2);b) assigning a orientation to each of the road segments (2);c) defining a search tree condition:(i) by means of the road section (2) of the node, the road map in n sub-planes (6a, b, c) partitioned, of which exactly one the road segment (2) contains;(ii) are the sub-planes as a function of the orientation of the road or street sections (2) arranged with respect to one another;(iii) all of the road segments (2) can be precisely one of the sub-planes, and thus accurately a part of a tree of the node associating;d) selecting one of the road segments (2);e) searching of the selected road section in the tree; the search ends at a node [end node] with a maximum of n - 1 partial trees, none of which the selected section of road (2) contains;f) appending of the selected road or street sections (2) as a blade at the end node according to such tree condition;g) repeating steps (d) to f), to each road section (2) has been selected exactly once;h) storing the directory on a ..
机译:提出了一种方法,利用该方法特别简单和有效的用于导航系统的数字道路地图(1、6a至6c)的道路路段(2)的目录。在这种情况下,目录接收有序n-树的数据结构,其中路段(2)存储在节点中。该方法具有以下步骤:a)相对于每个路段(2)分配地理位置; b)为每个路段(2)分配方向; c)定义搜索树条件:(i)通过该节点的路段(2),在n个子平面(6a,b,c)中划分了道路地图,其中路段(2)恰好包含一个;(ii)是子平面取决于彼此相对布置的道路或街道部分(2)的方向;(iii)所有路段(2)可以精确地是一个子平面,因此可以精确地是关联节点的树; d)选择路段之一(2); e)在树中搜索所选路段;搜索在最多包含n-1个局部树的节点[end node]处结束,其中所选路段(2)都不包含; f)将所选路段或街道段(2)作为叶片附加在根据这种树状条件的末端节点; g)对每个路段(2)重复选择步骤(d)至f),仅精确选择一次; h)将目录存储在。

著录项

  • 公开/公告号DE102007016002A1

    专利类型

  • 公开/公告日2008-10-09

    原文格式PDF

  • 申请/专利权人

    申请/专利号DE20071016002

  • 发明设计人

    申请日2007-04-03

  • 分类号G01C21/32;

  • 国家 DE

  • 入库时间 2022-08-21 19:49:17

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号