公开(公告)号：US08787703B2

公开(公告)日：2014-07-22

申请号：US13412215

申请日：2012-03-05

申请人： Philipp Kandal ,  Stefan Karschti

发明人： Philipp Kandal ,  Stefan Karschti

IPC分类号： G06K9/32 ,  G08G1/123

CPC分类号： G01C21/32 ,  G01C21/367

摘要： A procedure for structuring and storing data representing the form of an object that can be represented by a set of interpolation points, wherein the data representing an object is stored in a hierarchy having at least two levels, wherein a subset of the data representing the object is saved at each level and wherein the data is assigned to the levels by selecting at least two anchor points, whose data is saved in the uppermost hierarchical level, from the set of interpolation points and by consecutively selecting, from the interpolation points remaining in the set, the interpolation point with the largest distance from a line through the interpolation points and anchor points that have already been assigned to levels.

摘要翻译： 一种用于构造和存储表示可由一组插值点表示的对象形式的数据的过程，其中表示对象的数据被存储在具有至少两个级别的层次中，其中表示对象的数据的子集 被保存在每个级别，并且其中通过从所述插值点集合中选择至少两个数据被保存在最上层级中的锚定点，并且从剩余的内插点连续地选择数据被分配给所述级别 设置与已经分配给级别的插补点和锚点之间的距离最大的插补点。

公开(公告)号：US20130142453A1

公开(公告)日：2013-06-06

申请号：US13412215

申请日：2012-03-05

申请人： Philipp Kandal ,  Stefan Karschti

发明人： Philipp Kandal ,  Stefan Karschti

IPC分类号： G06K9/32

CPC分类号： G01C21/32 ,  G01C21/367

摘要： A procedure for structuring and storing data representing the form of an object that can be represented by a set of interpolation points, wherein the data representing an object is stored in a hierarchy having at least two levels, wherein a subset of the data representing the object is saved at each level and wherein the data is assigned to the levels by selecting at least two anchor points, whose data is saved in the uppermost hierarchical level, from the set of interpolation points and by consecutively selecting, from the interpolation points remaining in the set, the interpolation point with the largest distance from a line through the interpolation points and anchor points that have already been assigned to levels.

摘要翻译： 一种用于构造和存储表示可由一组插值点表示的对象形式的数据的过程，其中表示对象的数据被存储在具有至少两个级别的层次中，其中表示对象的数据的子集 被保存在每个级别，并且其中通过从所述插值点集合中选择至少两个数据被保存在最上层级中的锚定点，并且从剩余的内插点连续地选择数据被分配给所述级别 设置与已经分配给级别的插补点和锚点之间的距离最大的插补点。

公开(公告)号：US08423275B1

公开(公告)日：2013-04-16

申请号：US13349100

申请日：2012-01-12

申请人： Philipp Kandal

发明人： Philipp Kandal

IPC分类号： G08G1/0968

CPC分类号： G01C21/3407 ,  G01C21/3476 ,  G01C21/3685 ,  G08G1/0112 ,  G08G1/0129 ,  G08G1/0141 ,  G08G1/096827 ,  G08G1/096838 ,  G08G1/14

摘要： A procedure for determining the probability of finding a parking place within a certain period of time on a pre-set stretch of road of an area with a multiplicity of stretches of road. With this procedure, motion profiles are detected and statistically evaluated of users of radiolocation-aided, especially satellite-aided, navigation aids in the area. For each user a) A “parking place found” event is determined; b) The stretch of road in which the “parking place found” event occurred is detected; c) The travel time is detected which the user expended in each of the stretches of the road until the “parking place found” event occurred. From the data thus acquired for a multiplicity of users, a probability is determined of finding a parking place within the set time span on the stretch of the road.

摘要翻译： 用于确定在具有多条道路的区域的预定路段的一定时间段内找到停车位的概率的程序。 通过该程序，可以对该地区的无线电定位辅助用途，特别是卫星辅助导航设备的用户进行运动配置文件的统计评估。 对于每个用户a）确定发现停车位的事件; b）发现停车场发生事件的道路延伸; c）检测到用户在道路的每段延伸到停车场发现事件发生之前花费的旅行时间。 根据如此获取的用于多个用户的数据，确定在道路的延伸部分的设定时间跨度内找到停车位置的概率。