-
Notifications
You must be signed in to change notification settings - Fork 0
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
Simplification approach #47
Comments
@martinfleis Can you give a concrete example of the T example is (1)? While I understand the scenario, it would be very helpful for clear case to visualize, especially going forward into a paper or presentation. |
For example these 3 at -36.8897222, 174.7512042 are nice T examples. You can process this with osmnx and get rid of that. But as a result, the new intersection will be in the centroid of the enclosed shape, hence breaking the continuity of the main street. This is how @Kryndlea correctly simplified this case: ![]() And this is a result of osmnx simplification using a small tolerance: ![]() Larger tolerance snaps the two on the bottom together but the one above shows exactly my point. While this algorithm will work for a roundabout, here it causes another trouble and, for example, |
Both related & unrelated at the same time is my approach on
However, some meta concepts might be of interest to us:
Please don't judge me on this LOL. Most of it was written in 2016-2018. |
I'll keep this open since we are still writing the paper. |
@martinfleis Since you have a healthy draft of this up in OverLeaf, shall we close this issue out? |
Let's keep it open. I'll need to translate this to the manuscript version. |
I think that whatever needed to be in the paper is now in overleaf. The rest were internal dev guidelines. |
I did some unstructured playing with momepy, osmnx and cityseer and wanted to step back to give a thought to the approach to simplification we shall probably adopt. Below are some initial thoughts that may (or may not) guide the work.
Simplification approach
Some comments on that.
Point 1 is what I've seen happening with both osmnx and cityseer. The algos have a tendency to overdo things in certain locations. Think of the dense network snapped to a single point in osmnx method.
Point 2 is more to slow down my own ambitions :D.
Point 3 is what we've already extensively discussed and what is not covered by existing tools at all (research gap)
Point 4 is aimed at attempts to solve everything with one algo - parenx case.
Point 5 is something we need to keep in mind all the time. Spaghetti intersections are everywhere but even when they are super visible, they may not be relevant to a use case.
Point 6 is clear I suppose. See cityseer and their thoughts on the order and repetition. It clearly matters.
All of this may be obvious but it helps me to clarify the goals before getting to coding. And it allows me to filter out useful existing tools from less useful.
Thoughts? Especially from @anastassiavybornova and @jGaboardi but also interested what others think. Maybe @Kryndlea and @dancejod may have insights derived from their manual simplification?
The text was updated successfully, but these errors were encountered: