Methods and systems for generating local-and global-walkable paths for route guidance
Generating local- and global-walkable paths for route guidance. At least one example is a computer-implemented method of generating comprehensive maps for route guidance, the method comprising: receiving, by a processor, a floorplan delineating walkable and non-walkable areas; performing, by the processor, spatial analysis regarding the walkable areas to find a path graph for the walkable areas, the path graph comprises a plurality of segments defined by vertices, and the plurality of segments defining local-walkable paths; and removing, by a processor, segments that intersect non-walkable areas to generate a set of global-walkable paths from the path graph.
1. A computer-implemented method of generating maps for route guidance, the method comprising:
receiving, by a processor, a floorplan delineating walkable and non-walkable areas;
performing, by a processor, spatial analysis regarding the walkable areas to find a path graph for the walkable areas, the path graph comprises a plurality of segments defined by vertices, and the plurality of segments defining local-walkable paths; and
removing, by a processor, segments that intersect non-walkable areas to generate a set of global-walkable paths from the path graph.
2. The computer-implemented method of claim 1 further comprising removing segments with lengths shorter than a predetermined length.
3. The computer-implemented method of claim 2 wherein removing segments further comprises removing segments recursively based on the predetermined length.
4. The computer-implemented method of claim 3 wherein the predetermined length is different for each recursive removing.
5. The computer-implemented method of claim 3 wherein predetermined length is shorter for each successive removing.
6. The computer-implemented method of claim 2 wherein removing recursively further comprises performing a predetermined number of the removings.
7. The computer-implemented method of claim 1 further comprising creating a merged segment based on a first branch and a second branch that share a vertex and form an acute angle equal to or smaller than a predetermined angle, and after the creating removing the first and second branches.
8. The computer-implemented method of claim 7 wherein the predetermined angle is 45 angular degrees.
9. The computer-implemented method of claim 7 further comprising repeating the creating of a merged segment for each set of branches that share a vertex and form an acute angles equal to or smaller than the predetermined angle.
10. The computer-implemented method of claim 7 wherein a length of the merged segment is at least one selected from a group comprising: an average of a length of the first branch and a length of the second branch; the shorter of the length of the first branch and the length of the second branch; and the longer of the length of the first branch and the length of the second branch.
11. A computer system comprising:
a processor;
a communications interface coupled to the processor;
a memory coupled to the processor, the memory storing instructions that, when executed by the processor, cause the processor to:
receive a floorplan delineating walkable and non-walkable areas;
perform spatial analysis regarding the walkable areas to find a path graph for the walkable areas, the path graph comprises a plurality of segments defined by vertices, and the plurality of segments defining local-walkable paths; and
remove segments that intersect non-walkable areas to generate a set of global-walkable paths from the path graph.
12. The computer system of claim 11 wherein the instructions further cause the processor to remove segments with lengths shorter than a predetermined length.
13. The computer system of claim 12 wherein when the processor removes segments, the instructions further causes the processor to remove segments recursively based on the predetermined length.
14. The computer system of claim 13 wherein the predetermined length is different for each recursive removing.
15. The computer system of claim 13 wherein predetermined length is shorter for each successive removing.
16. The computer system of claim 12 wherein when the processor removes recursively, the instructions further cause the processor to perform a predetermined number of the removings.
17. The computer system of claim 11 wherein the instructions further cause the processor to create a merged segment based on a first branch and a second branch that share a vertex and form an acute angle equal to or smaller than a predetermined angle, and after the creation remove the first and second branches.
18. The computer system of claim 17 wherein the predetermined angle is 45 angular degrees.
19. The computer system of claim 17 wherein the instructions further cause the processor to repeat the creation of a merged segment for each set of branches that share a vertex and form an acute angles equal to or smaller than the predetermined angle.
20. The computer system of claim 17 wherein a length of the merged segment is at least one selected from a group comprising: an average of a length of the first branch and a length of the second branch; the shorter of the length of the first branch and the length of the second branch; and the longer of the length of the first branch and the length of the second branch.