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: | Dalal, Ketan |
---|---|
Other Authors: | Devroye, Luc (advisor) |
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 |
Similar Items
-
The Onion Name System| Tor-powered distributed DNS for tor hidden services
by: Victors, Jesse
Published: (2015) -
Determinism, nondeterminism, alternation, and counting /
by: Gupta, Sanjay
Published: (1993) -
Gallager's algorithm and the count-to-infinity problem
by: Tam, Donna
Published: (1990) -
Pedestrian counting estimation based on fractal dimension
by: Andrés C. Jiménez, et al.
Published: (2019-04-01) -
On Geometric Range Searching, Approximate Counting and Depth Problems
by: Afshani, Peyman
Published: (2008)