Counting the onion
Iteratively computing and discarding a set of convex hulls creates a structure known as an "onion". In this thesis, we show that the expected number of layers of a convex hull onion for n uniformly and independently distributed points in a disk is theta( n23 ). Additionally, we show tha...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
McGill University
2004
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=80247 |