Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 1 down vote favorite

I know that visibility graph is used to determine the shortest path between two points a mong a set of obstacles in the plane. So in the case that obstacles are triangles, is the maximal number of shortest paths between two points 3? Any hint to prove that?

share|improve this question
2  
If you add a flat triangle perpendicular to a straight portion of the path, symmetrically, it doubles the number of shortest paths, so it looks like the maximal number of shortest paths is unbounded. – galath Apr 25 '12 at 16:10
I meant "it increases the number of shortest paths". (doesn't have to be doubled) – galath Apr 26 '12 at 1:28
The tag graph is intended for questions about graphs of functions, see the tag-wiki and the tag-excerpt. (The tag-excerpt is also shown when you are adding a tag to a question.) There is a separate tag for graph-theory. – Martin Sleziak Mar 25 at 12:49

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.