METHOD FOR STITCHING MULTIPLE CONVERGING PATHS
First Claim
1. A method of stitching multiple converging paths of a map to be displayed on a wireless communications device, the method comprising steps of:
- providing map data for rendering the map on a display of the device, the map data including label data for labelling paths on the map;
identifying at least three path segments that converge to a common point on the map, each of the path segments having an identical label;
determining an angle subtended by each pair of adjacent path segments in order to identify which pair of adjacent path segments subtends the largest angle; and
generating a reconstructed path by stitching together the pair of adjacent path segments subtending the largest angle.
7 Assignments
0 Petitions
Accused Products
Abstract
A method of stitching converging path segments to aesthetically label Y-intersections, path bifurcations or splits in roads or the like entails determining which pair of adjacent path segments subtend the largest angle. The path segments subtending the largest angle are reconstructed (stitched together) and a single instance of the label is then rendered along the reconstructed path. Although this stitching can be performed on the client device, pre-stitching server-side is even more efficient in terms of economizing over-the-air bandwidth and onboard processing resources.
33 Citations
21 Claims
-
1. A method of stitching multiple converging paths of a map to be displayed on a wireless communications device, the method comprising steps of:
-
providing map data for rendering the map on a display of the device, the map data including label data for labelling paths on the map; identifying at least three path segments that converge to a common point on the map, each of the path segments having an identical label; determining an angle subtended by each pair of adjacent path segments in order to identify which pair of adjacent path segments subtends the largest angle; and generating a reconstructed path by stitching together the pair of adjacent path segments subtending the largest angle. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer program product comprising a computer-readable medium having code executable by a processor to perform the steps of:
-
providing map data for rendering the map on a display of the device, the map data including label data for labelling paths on the map; identifying at least three path segments that converge to a common point on the map, each of the path segments having an identical label; determining an angle subtended by each pair of adjacent path segments in order to identify which pair of adjacent path segments subtends the largest angle; and generating a reconstructed path by stitching together the pair of adjacent path segments subtending the largest angle. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A wireless communications device for enabling a user of the device to display a map on the device, the wireless device comprising:
-
an input device for enabling the user to cause the device to obtain map data for rendering the map to be displayed on a display of the device, the map data including label data for labelling paths on the map; and a memory for storing code to instruct a processor to; identify at least three path segments that converge to a common point on the map, each of the path segments having an identical label; determine an angle subtended by each pair of adjacent path segments in order to identify which pair of adjacent path segments subtends the largest angle; generate a reconstructed path by stitching together the pair of adjacent path segments subtending the largest angle; and render a single instance of the label along the reconstructed path. - View Dependent Claims (18, 19, 20, 21)
-
Specification