Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

WIP: Endpoint-based naming strategy #14

Draft
wants to merge 8 commits into
base: master
Choose a base branch
from
Draft

Conversation

taradinoc
Copy link
Owner

No description provided.

taradinoc and others added 8 commits June 14, 2017 14:49
This adds a demo project to find natural-looking endpoints of a bus line,
even when the stops are placed starting in the middle. We assemble the
stops into a polygon, then find the "longest shortest path" that connects
any two stops without exiting the polygon.

The algorithm could still use some more optimization, and will need to be
modified to work as part of the mod (point types, C# language version, etc).
Fixed bug where Intersects and FindIntersection sometimes disagreed about whether two segments intersected.
Fixed bug where the path could escape the polygon by crossing through a vertex.
This adds a demo project to find natural-looking endpoints of a bus line,
even when the stops are placed starting in the middle. We assemble the
stops into a polygon, then find the "longest shortest path" that connects
any two stops without exiting the polygon.

The algorithm could still use some more optimization, and will need to be
modified to work as part of the mod (point types, C# language version, etc).
Fixed bug where Intersects and FindIntersection sometimes disagreed about whether two segments intersected.
Fixed bug where the path could escape the polygon by crossing through a vertex.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant