Timeline for Smooth convex hull of a large data set of 3D points
Current License: CC BY-SA 3.0
12 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 18, 2016 at 21:34 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
deleted 60 characters in body
|
Dec 17, 2016 at 20:48 | answer | added | J. M.'s missing motivation♦ | timeline score: 10 | |
Apr 11, 2016 at 1:30 | vote | accept | Jonathan Prieto-Cubides | ||
Mar 5, 2016 at 23:58 | history | edited | J. M.'s missing motivation♦ | CC BY-SA 3.0 |
edited title
|
Mar 5, 2016 at 16:41 | answer | added | Quantum_Oli | timeline score: 12 | |
Jan 9, 2015 at 18:17 | comment | added | user24615 | There are routines to calculate MVE ellipsoids in MATLAB. You could just translate one to Mathematica. | |
Aug 24, 2014 at 7:55 | history | tweeted | twitter.com/#!/StackMma/status/503450490865467392 | ||
Aug 21, 2014 at 15:49 | comment | added | Jonathan Prieto-Cubides | Yes, I mean, smooth convex hull as differential function. So, the other comment is probably that I need. I'll read the paper, and If I success, I write hear my trie. | |
Aug 21, 2014 at 9:11 | comment | added | user484 | I second user21's question; there is no standard notion of a "smooth convex hull". If you really really want an ellipsoid, you could try finding the minimum-volume ellipsoid enclosing your set of points. | |
Aug 21, 2014 at 7:39 | comment | added | user21 | What exactly do you mean by 'smooth convex hull', or, how is an ellipsoid a convex hull for your data? Could you explain that a bit. | |
Aug 21, 2014 at 6:16 | history | edited | m_goldberg | CC BY-SA 3.0 |
Made English clearer and more idiomatic
|
Aug 21, 2014 at 5:55 | history | asked | Jonathan Prieto-Cubides | CC BY-SA 3.0 |