Method and system for generating fixed transit routes

1. A method for generating fixed transit routes, comprising:

identifying a first set of street network segments within a first threshold distance from a first point for a pattern inputted by a user, and a proxy first point along each of said street network segments in said first set;

identifying a second set of street network segments within a second threshold distance from a second point for said pattern inputted by said user, and a proxy second point along each of said street network segments in said second set; and

determining a best path for said pattern including any one of said proxy first points along said street network segments in said first set and any one of said proxy second points along said street network segments in said second set, wherein said determining further comprises:

creating temporary network segments from said first point to each of said proxy first points along said street network segments in said first set, and from said second point to each of said proxy second points along said street network segments in said second set; and

determining said best path from said first point and along any one of said temporary network segments to said proxy first points along said street network segments in said first set to said second point via any one of said temporary network segments to said proxy second points along said street network segments in said second set.

2. The method of claim 1 , wherein said identifying said first set comprises:

determining a shortest distance from said first point to any one of said street network segments adjacent said first point; and

determining said first threshold distance as a multiple of said shortest distance.

3. The method of claim 2 , further comprising:

setting a minimum threshold

setting said shortest distance to said minimum threshold if said shortest distance is below said minimum threshold.

4. The method of claim 1 , wherein said identifying said second set comprises:

determining a shortest distance from said second point to any of said street network segments adjacent said second point; and

determining said second threshold distance as a multiple of said shortest distance.

5. The method of claim 4 , further comprising:

setting a minimum threshold

setting said shortest distance to said minimum threshold if said shortest distance is below said minimum threshold.

6. The method of claim 1 , further comprising:

iteratively performing said identifying of said first and second sets and said determining for pairs of points along said pattern, said pairs defining pattern sections.

7. The method of claim 6 , further comprising:

connecting said pattern sections to form said pattern.

8. The method of claim 1 , further comprising:

storing a portion of said best path from said proxy first point adjacent said first point to said proxy second point adjacent said second point.

9. A computer system for generating fixed transit routes, comprising:

computer-executable instructions executed by a processor identifying a first set of street network segments within a first threshold distance from a first point for a pattern inputted by a user and a proxy first point along each of said street network segments in said first set, identifying a second set of street network segments within a second threshold distance from a second point for said pattern inputted by said user and a proxy second point along each of said street network segments in said second set, and determining a best path for said pattern including any one of said proxy first points along said street network segments in said first set and any one of said proxy second points along said street network segments in said second set, wherein said determining further comprises creating temporary network segments from said first point to each of said proxy first points along said street network segments in said first set, and from said second point to each of said proxy second points along said street network segments in said second set and determining said best path from said first point and along any one of said temporary network segments to said proxy first points along said street network segments in said first set to said second point via any one of said temporary network segments to said proxy second points along said street network segments in said second set.

10. A non-transitory computer-readable medium having stored thereon computer-executable instructions implementing an application for generating fixed transit routes, said application identifying a first set of street network segments within a first threshold distance from a first point for a pattern inputted by a user, and a proxy first point along each of said street network segments in said first set, identifying a second set of street network segments within a second threshold distance from a second point for said pattern inputted by said user, and a proxy second point along each of said street network segments in said second set, and determining a best path for said pattern including any one of said proxy first points along said street network segments in said first set and any one of said proxy second points along said street network segments in said second set, wherein said determining further comprises creating temporary network segments from said first point to each of said proxy first points along said street network segments in said first set, and from said second point to each of said proxy second points along said street network segments in said second set and determining said best path from said first point and along any one of said temporary network segments to said proxy first points along said street network segments in said first set to said second point via any one of said temporary network segments to said proxy second points along said street network segments in said second set.