Timeline for Point in Polygon algorithm from the viewpoint of a robot
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 25, 2010 at 12:55 | comment | added | ohadsc | @Mark Why a comment and not an answer ? Anyways "then if you are outside you will come to a point on the convex hull from which you can see that the whole fence is on one side of you and there is no fence on the other side" - at that point, looking at any other angle, you'd see the sea which is simpler right ? This is the algorithm I originally thought about - walk the fence and look at all angles for the sea. Obviously this would work, but the "1 meter" solution seems faster if you don't have line of sight and have to walk every time | |
| Dec 25, 2010 at 7:27 | comment | added | Mark Bennet | The fence needs to have measurable finite length for the supposed solution to be meaningful as stated. Pedantically, if you can walk both sides of the fence you are able to cross it. If you can see, and line of sight is blocked only by the fence (island is flat enough), then if you are outside you will come to a point on the convex hull from which you can see that the whole fence is on one side of you and there is no fence on the other side. [again subject to topography, there will be a point from which you can see the sea]. Mark a point on the fence. When you return you know. | |
| Dec 24, 2010 at 19:04 | answer | added | sleepless in beantown | timeline score: 2 | |
| Dec 24, 2010 at 17:29 | vote | accept | ohadsc | ||
| Dec 24, 2010 at 17:17 | answer | added | Igor Rivin | timeline score: 6 | |
| Dec 24, 2010 at 17:17 | history | edited | ohadsc | CC BY-SA 2.5 |
added 41 characters in body
|
| Dec 24, 2010 at 17:11 | history | asked | ohadsc | CC BY-SA 2.5 |