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

  • How to Choose a General Contractor for a Custom Home

    How to Choose a General Contractor for a Custom Home

    December 8, 2022
  • How Do Security Systems Work at Home?

    How Do Security Systems Work at Home?

    December 1, 2022
  • Common CCTV Problems and Their Fixes

    Common CCTV Problems and Their Fixes

    November 24, 2022

Recent Posts

  • How to Choose a General Contractor for a Custom Home
  • How Do Security Systems Work at Home?
  • Common CCTV Problems and Their Fixes
  • How to Choose Upholstery Fabric?
  • Why Educational Signage Is Important?
  • Pros and Cons of Foam Filled Tires
  • What Does an Accountant Do?
  • Types of Vacuum Cleaners
  • Tips For Hiring a Ducted Air Conditioning Installer
  • Common Roofing Problems And How To Fix Them

Archives

  • December 2022
  • November 2022
  • October 2022
  • September 2022
  • August 2022
  • July 2022
  • 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
March 2023
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
2728293031  
« Dec    
Theme by ThemesPie | Proudly Powered by WordPress