公开(公告)号：US09395193B2

公开(公告)日：2016-07-19

申请号：US13632004

申请日：2012-09-30

Applicant: Apple Inc.

Inventor： Guillaume A. Carbonneau ,  Vincent Dumont ,  Anuj Dhamija ,  Denis Laprise ,  Okan Arikan ,  James A. Howard

IPC: G06T11/20 ,  G01C21/32 ,  G06T11/00

CPC classification number: G01C21/32 ,  G06T11/00

Abstract: A process is provided that reduces the amount of data for a map tile that could not be displayed separately on the scale of that tile. The process generates an equivalent of the road data by rasterizing the vectors representing road segments lying within a tile and generating a connectivity mask that keeps track of which pixels are connected to which other pixels along the vectors. The process constructs an undirected graph. Each “on” pixel of the undirected graph represents a vertex and the vertices are connected by edges generated from the connectivity graph, but without a set direction. The process traces the undirected graph to generate chains of connected road segments and takes the chains and simplifies them in order to reduce the amount of data that must be stored and transmitted for the tile in order to produce all the visible roads of the tile at that scale.

Abstract translation: 提供了一个过程，减少了无法在该图块的比例上单独显示的地图图块的数据量。 该过程通过光栅化表示位于瓦片内的道路段的矢量来生成道路数据的等价物，并且生成连接掩模，该连接掩模跟踪哪些像素连接到沿向量的哪个其他像素。 该过程构建无向图。 无向图中的每个“on”像素表示顶点，并且顶点通过从连接图生成的边缘连接，但没有设置方向。 该过程跟踪无向图，以产生连接的路段的链，并采取链并简化它们，以减少必须为瓦片存储和传输的数据量，以便生成瓦片的所有可见道路 规模。

公开(公告)号：US20130328879A1

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

申请号：US13632004

申请日：2012-09-30

Applicant: APPLE INC.

Inventor： Guillaume A. Carbonneau ,  Vincent Dumont ,  Anuj Dhamija ,  Denis Laprise ,  Okan Arikan ,  James A. Howard

IPC: G06T11/20

CPC classification number: G01C21/32 ,  G06T11/00

Abstract: A process is provided that reduces the amount of data for a map tile that could not be displayed separately on the scale of that tile. The process generates an equivalent of the road data by rasterizing the vectors representing road segments lying within a tile and generating a connectivity mask that keeps track of which pixels are connected to which other pixels along the vectors. The process constructs an undirected graph. Each “on” pixel of the undirected graph represents a vertex and the vertices are connected by edges generated from the connectivity graph, but without a set direction. The process traces the undirected graph to generate chains of connected road segments and takes the chains and simplifies them in order to reduce the amount of data that must be stored and transmitted for the tile in order to produce all the visible roads of the tile at that scale.

Abstract translation: 提供了一个过程，减少了无法在该图块的比例上单独显示的地图图块的数据量。 该过程通过光栅化表示位于瓦片内的道路段的矢量来生成道路数据的等价物，并且生成连接掩模，该连接掩模跟踪哪些像素连接到沿向量的哪个其他像素。 该过程构建无向图。 无向图中的每个“on”像素表示顶点，并且顶点通过从连接图生成的边缘连接，但没有设置方向。 该过程跟踪无向图，以产生连接的路段的链，并采取链并简化它们，以减少必须为瓦片存储和传输的数据量，以便生成瓦片的所有可见道路 规模。