anvaka / anvaka/ngraph.path

"fewest turns" refinement?

Open
#2 5 comments 3 reactions 0 assignees View on GitHub
Dominant language
JavaScript
Stars
3.1k
Forks
192
PR merge metrics
No merged PRs in 30d

Description

hey @anvaka,

nice lib!

how feasible is it to add some post-processing pass to produce a "fewest turns" route to reduce the number of left-right-left-right turns in the path at the expense of some configurable "cost" for additional distance added to the route.

i frequently find it ultra aggravating when a destination can be reached with 3 turns and an extra 0.25mi rather than 7 turns. it simplifies the directions and number of legs in each route. google maps has a habit of providing such "scenic" routes.

thanks!

![turns](https://user-images.githubusercontent.com/43234/30708706-6e1eeb9e-9ec5-11e7-8b69-3d34e644bb51.png)

Contributor guide

No contributing guide indexed for this repository

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.