Information Geometry

  • Home
  • About Us
  • Privacy Policy
  • Contact Us
Home  /  News  /  Convex Hull Peeling

Convex Hull Peeling

Frank March 04, 2010 News Comments are off

A long time ago, well in 1996, I investigated output-sensitive algorithms. I then designed an algorithm for peeling iteratively the convex hulls of a 2D point set. This yields the notion of depth of a point set, and is a useful index in statistics as attested by recent papers published in this area.

Here is the reference work:
Output-sensitive peeling of convex and maximal layers

Share this...
Share on Facebook
Facebook
Pin on Pinterest
Pinterest
Tweet about this on Twitter
Twitter
Share on LinkedIn
Linkedin
Previous Article
Next Article

About Author

Frank

Related Posts

  • What Do Solar Developers Do?

    What Do Solar Developers Do?

    June 28, 2022
  • Breast Enlargement Surgery

    Breast Enlargement Surgery

    June 17, 2022
  • Using Digital Marketing Services to Position Your Brand Online

    June 9, 2022

Recent Posts

  • What Do Solar Developers Do?
  • Breast Enlargement Surgery
  • Using Digital Marketing Services to Position Your Brand Online
  • How Do I Pack Properly for When I Move House
  • What is the Difference Between an Assistance Dog & a Service Dog?
  • What are the Types of Rehabilitation?
  • How to set up a Craft Brewery
  • Preparing Your Garden
  • The Importance of Pool Cleaning
  • Executive Coaching For Business Owners

Archives

  • June 2022
  • May 2022
  • April 2022
  • February 2022
  • January 2022
  • December 2021
  • November 2021
  • October 2021
  • September 2021
  • August 2021
  • June 2010
  • May 2010
  • April 2010
  • March 2010
June 2022
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
27282930  
« May    
Theme by ThemesPie | Proudly Powered by WordPress