Method for stitching multiple converging paths
View Patent ↗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.
1. A method for a server to pre-stitch multiple converging segments of a map feature of a map requested by a wireless communications device, the method comprising:
receiving a request for map data from the wireless communications device, the map data including label data for labelling the map feature;
identifying at least three segments that converge to a common point on the map, each of the segments having an identical label;
determining an angle subtended by each pair of adjacent segments;
identifying, using at least one determined angle, which pair of adjacent segments subtends a largest angle;
generating a reconstructed map feature at the server by stitching together the pair of adjacent segments subtending the largest angle; and
transmitting to the wireless communications device the map data for the reconstructed map feature.
2. The method as claimed in claim 1 wherein transmitting the map data for the reconstructed map feature further comprises transmitting a single instance of a label for the reconstructed map feature.
3. The method as claimed in claim 1 wherein determining the angle subtended by each pair of adjacent segments comprises:
determining vector directions for each of the segments at the common point where the segments converge; and
computing angles between adjacent vectors.
4. The method as claimed in claim 2 further comprising:
determining a center of the reconstructed map feature; and
verifying whether placement of the label at the center of the reconstructed map feature interferes with any other label.
5. The method as claimed in claim 1 wherein identifying at least three segments that converge to the common point on the map comprises identifying a Y-intersection having exactly three path segments.
6. The method as claimed in claim 1 wherein determining an angle in order to identify which pair of adjacent segments subtends the largest angle comprises determining, in a case where two of the largest angles are equal, which of the adjacent segments would result in a more horizontally level label.
7. A non-transitory computer readable medium comprising code for storable in a memory of a server and executable by a processor of the server to cause the server to:
receive a request for map data from a wireless communications device, the map data including label data for labelling a map feature on a map;
identify at least three segments that converge to a common point on the map, each of the segments having an identical label;
determine an angle subtended by each pair of adjacent segments;
identify, using at least one determined angle, which pair of adjacent segments subtends a largest angle;
generate a reconstructed map feature by stitching together the pair of adjacent segments subtending the largest angle; and
transmit to the wireless communications device the map data for the reconstructed map feature.
8. The computer readable medium as claimed in claim 7 wherein the code is configured to cause the server to transmit a single instance of a label for the reconstructed map feature.
9. The computer readable medium as claimed in claim 7 wherein the code to determine the angle subtended by each pair of adjacent segments further causes the server to:
determine vector directions for each of the segments at the common point where the segments converge; and
compute angles between adjacent vectors.
10. The computer readable medium as claimed in claim 8 wherein the code configured to cause the server to transmit a single instance of the label further causes the server to:
determine a center of the reconstructed map feature; and
verify whether placement of the label at the center of the reconstructed map feature interferes with any other label.
11. The computer readable medium as claimed in claim 8 wherein the code to identify at least three segments that converge to a common point on the map further causes the server to identify a Y-intersection having exactly three path segments.
12. The computer readable medium as claimed in claim 8 wherein the code to determine an angle in order to identify which pair of adjacent segments subtends the largest angle further causes the server to determine, in a case where two of the largest angles are equal, which of the adjacent segments would result in a more horizontally level label.
13. A server for serving map data to a client device, the server comprising:
a memory for storing map data; and
a processor operatively coupled to the memory, the processor causing the server to:
in response to a request for map data, identify at least three segments that converge to a common point on a map, each of the segments having an identical label;
determine an angle subtended by each pair of adjacent segments;
identify, using at least one determined angle, which pair of adjacent segments subtends a largest angle;
generate a reconstructed map feature by stitching together the pair of adjacent segments subtending the largest angle; and
transmit the map data for the reconstructed map feature.
14. The server as claimed in claim 13 wherein the processor determines the angle subtended by each pair of adjacent segments by:
determining vector directions for each of the segments at the common point where the segments converge; and
computing angles between adjacent vectors.
15. The server as claimed in claim 13 wherein the processor determines a center of the reconstructed map feature and verifies whether placement of the label at the center of the reconstructed map feature interferes with any other label.
16. The server as claimed in claim 13 wherein the processor identifies at least three segments that converge to a common point on the map by identifying a Y-intersection having exactly three path segments.
17. The server as claimed in claim 13 wherein the processor further determines, in a case where two of the largest angles are equal, which of the adjacent segments would result in a more horizontally level label.
18. The server as claimed in claim 13 wherein the processor further causes the server to transmit a single instance of a label for the reconstructed map feature.