Timeline for maximum number of shortest path among a set of n triangle obstacles
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2017 at 10:39 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
deleted 23 characters in body
|
| May 4, 2012 at 18:25 | comment | added | Gerhard Paseman | I just realized one can use triangles shrinking to 0 and solve with an upper bound on the triangle size. Now to see if one can bound away from zero also. Gerhard "Ask Me About System Design" Paseman, 2012.05.04 | |
| May 2, 2012 at 12:02 | history | edited | Barry Cipra | CC BY-SA 3.0 |
fixed a typo
|
| May 2, 2012 at 11:22 | comment | added | Joseph O'Rourke | @Barry: Nice new construction! (I'm traveling and cannot play a draftsman role.) | |
| May 2, 2012 at 5:12 | history | edited | Barry Cipra | CC BY-SA 3.0 |
added 282 characters in body
|
| May 2, 2012 at 3:21 | history | edited | Barry Cipra | CC BY-SA 3.0 |
added 1890 characters in body; added 3 characters in body
|
| May 2, 2012 at 0:58 | comment | added | Joseph O'Rourke | @Barry: I added a figure, taking some liberties: (a) I used segments instead of triangles; (b) I did not follow your coordinates for the yellow splitters, but I hope captured your (nice!) idea. | |
| May 2, 2012 at 0:56 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 173 characters in body
|
| May 1, 2012 at 23:30 | comment | added | Gerhard Paseman | Oops again. It looks like have n+m fences with that arrangement, and only two paths. Perhaps a grid arrangement will work, but I will stop here. Gerhard "Cares To Stop Insufficient Care" Paseman, 2012.05.01 | |
| May 1, 2012 at 22:55 | comment | added | Gerhard Paseman | oops, I meant shifted copies of the triangle. Gerhard "Really, I Was Thinking Triangle" Paseman, 2012.05.01 | |
| May 1, 2012 at 22:54 | comment | added | Gerhard Paseman | For more components but of bounded size, take m x n laterally shifted copies of the rectangle with vertices (1,0), (0,1), and (epsilon, epsilon) for appropriate epsilon, say epsilon = 1/100, and place so the centroids are in an mxn square grid; There will be superpolynomially many paths of length m+n from the origin to (m,n). This uses only bounded isosceles triangles, although it uses many more of them. Gerhard "Ask Me About System Design" Paseman, 2012.05.01 | |
| May 1, 2012 at 22:39 | history | answered | Barry Cipra | CC BY-SA 3.0 |