Assume that we have a two different distinct points. The number of shortest path between these two points is one. When we add a triangle obstacle to the plane and this triangle intersects the line connecting two above points. The possible maximum number of shortest path in this case is two(depends two (depending on how we add the triangle). So how does the number of shortest path changes paths change if we continue adding triangle triangles to the plane. ? What is the possible maximum possible number of shortest path paths between two points among a set of n $n$ triangle obstacles?