Counting the onion
From MaRDI portal
Publication:4459587
DOI10.1002/RSA.10114zbMATH Open1041.60011OpenAlexW2089842370MaRDI QIDQ4459587FDOQ4459587
Authors: Ketan Dalal
Publication date: 29 March 2004
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10114
Recommendations
Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Random convex sets and integral geometry (aspects of convex geometry) (52A22)
Cited In (12)
- On separating points by lines
- Grid peeling and the affine curve-shortening flow
- Hamilton-Jacobi scaling limits of Pareto peeling in 2D
- Dynamic ham-sandwich cuts in the plane
- Expected size of random Tukey layers and convex layers
- New estimates for convex layer numbers
- Eikonal depth: an optimal control approach to statistical depths
- The limit shape of convex hull peeling
- Counting triangulations and other crossing-free structures via onion layers
- An application of the onion peeling algorithm for fingerprint verification purposes
- Limit theory for the first layers of the random convex hull peeling in the unit ball
- The layer number of \(\alpha \)-evenly distributed point sets
This page was built for publication: Counting the onion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459587)