Timeline for Find local maximum in 3D list
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2013 at 9:40 | answer | added | Kuba | timeline score: 2 | |
| Jun 24, 2013 at 8:09 | history | tweeted | twitter.com/#!/StackMma/status/349076835847512064 | ||
| Jun 24, 2013 at 8:02 | vote | accept | Neuneck | ||
| Jun 24, 2013 at 7:54 | answer | added | Szabolcs | timeline score: 3 | |
| Jun 24, 2013 at 7:54 | comment | added | Kuba | Other way is to create Median filter. en.wikipedia.org/wiki/Median_filter | |
| Jun 24, 2013 at 7:46 | comment | added | Szabolcs | One possibility would be to construct the Delaunay triangulation ( = find nearest neighbours), then pick those $(x,y)$ points which have a higher $z$ value than all of their neighbours. Check the ComputationalGeometry package for Delaunay triangulation. | |
| Jun 24, 2013 at 7:43 | history | asked | Neuneck | CC BY-SA 3.0 |