Timeline for Find a line that connects the outer most points in a set of points
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 29, 2012 at 13:34 | comment | added | jcora | Maybe something BFS-like? | |
| Feb 27, 2012 at 15:58 | vote | accept | Majd | ||
| Feb 27, 2012 at 15:58 | vote | accept | Majd | ||
| Feb 27, 2012 at 15:58 | |||||
| Feb 27, 2012 at 14:05 | answer | added | MrCranky | timeline score: 8 | |
| Feb 27, 2012 at 13:11 | comment | added | MrCranky | Unclear question: your image shows two distinct point clouds with their own boundaries. The algorithm to find a polygon which describes the cloud boundary is different from one which can identify clusters of points. Basically it seems like you want to do cluster analysis first (to identify distinct areas of the point cloud), and then within a cloud find a boundary polygon. But your question doesn't make this clear. | |
| Feb 27, 2012 at 12:26 | vote | accept | Majd | ||
| Feb 27, 2012 at 15:58 | |||||
| Feb 27, 2012 at 12:15 | answer | added | amb | timeline score: 7 | |
| Feb 27, 2012 at 12:02 | history | asked | Majd | CC BY-SA 3.0 |