CGAL users discussion list

[Raheem Rufai <>]

Hi Rich,

 

I'm not sure you'll be able to find all of those in a single package, but you might be able to easily implement at least some of them using CGAL or even matlab. For instance, to implement onion peeling depth, you can simply repeatedly invoke any convex hull algorithms, discard points on the hull until you run out of points. The number of iterations of is your depth.

 

 

Regards,

 

Raheem

On Tue, Jul 6, 2010 at 1:20 PM, Army_PhD_Student <> wrote:

Dear CGAL Subscribers,

I'm currently assigned to a university as a PhD student, and I'm working on
a multivariate statistics problem involving the use of data depth.  I'm
considering various data depth methods in my research, including halfspace
depth, convex hull peeling depth, simplicial depth, projection depth,
Mahalanobis depth, proximity depth, majority depth, zonoid depth, etc.
Other than the Tufts University Computational Geometry website, does anyone
know of any sources where I might find pre-existing computer code for data
depth?

Thank you in advance for your time.

Sincerely,

Rich Bell
Lieutenant Colonel, US Army
--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/PhD-Student-Seeking-Algorithms-for-Computing-Data-Depth-tp2279891p2279891.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss

-- 
«To develop software is to build a machine simply by describing it.» (Michael A. Jackson -- not the singer)