Conversation

Replying to
I mean I just made up the ratio but the 2 quantities are well-known things… a fractal would end up at like 0.7 or something for eg. Legible things would be 1
1
1
Replying to and
Graph shortest path is very unlikely to honor the triangle inequality. Trying to apply spatial metaphors to graphs seems ill-fated, at best you can try to have edges represent orientational metaphors a la Lakoff and Johnson.
2
1
Replying to and
I don’t understand what you’re talking about An illegible environment will have wiggly paths that will on average be longer than Euclidean shortest path, You’re not applying the triangle inequality on the graph. You’re applying it in the embedding space where it will work fine
2
Replying to and
A lot of graphs aren't planar! If your graph *is* planar, then each vertex has a direct relationship to the nearby vertices on the plane, but if it isn't, then it may only have an indirect relationship to the neighbor, per whatever layout you've chosen.
2