Timeline for Connectivity in random points on a grid using a rope of fixed length.
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2011 at 13:23 | comment | added | SpringCoder | @Gery: Yes, I suddenly forgot the definition and went back to check it..you have pointed in the right direction. Thanks a lot. I am trying to see how the $l,b$ parameters can now fit in! | |
| Apr 5, 2011 at 13:16 | comment | added | Gerry Myerson | @SpringCoder, did you look to see what a Steiner tree is? | |
| Apr 5, 2011 at 9:00 | comment | added | SpringCoder | Yes $P(k,n,l,b)$ is the probability I am looking for. The rope may or may not run along grid lines. I think it might be easier to consider that it does not run along grid lines. However the original problem I have in mind does require the rope be along grid lines. But if the problem can be solved as $L_{2}$ norm distances then $L_{1}$ norm probability will be higher! How does Steiner tree fit here? | |
| Apr 5, 2011 at 6:29 | comment | added | Gerry Myerson | I think you're asking for $P(k,n,l,b)$, the probability that you can connect all the points, maybe you could confirm this. Also I think the keyphrase you're looking for is "Steiner tree." Must all the rope bits run along gridlines? This, too, should be clarified. | |
| Apr 5, 2011 at 6:23 | history | asked | SpringCoder | CC BY-SA 2.5 |