Finding the edge of a Poisson forest
From MaRDI portal
Cited in
(29)- On the number of clusters
- Geometrical tools in classification
- A discriminant analysis algorithm for the inside/outside problem
- Complexity penalized support estimation.
- Polynomial volume estimation and its applications
- Fold-up derivatives of set-valued functions and the change-set problem: a survey
- Methods for estimation of convex sets
- New methods for bias correction at endpoints and boundaries
- Estimating the edge of a Poisson process by orthogonal series
- Regression and edge estimation
- Asymptotic behavior of samples from general multivariate distributions
- Classification of events using local pair correlation functions for spatial point patterns
- Methods for tracking support boundaries with corners
- Set estimation and nonparametric detection.
- A fully data-driven method for estimating the shape of a point cloud
- Stochastische Approximation konvexer Polygone
- Reconstruction échantillonnale d'une forme convexe
- Unbiased estimation of the volume of a convex body
- On functionals of random convex hulls
- Random uniform triangles and the alignment problem
- On resampling schemes for polytopes
- Identifying genuine clusters in a classification
- Covariate construction of nonconvex windows for spatial point patterns
- Multiple hypothesis testing with persistent homology
- Poisson hulls
- Analyzing Spatial Point Patterns in Digital Pathology: Immune Cells in High-Grade Serous Ovarian Carcinomas
- Estimating the convex hull of the image of a set with smooth boundary: error bounds and applications
- Local empirical processes near boundaries of convex bodies
- A multivariate uniformity test for the case of unknown support
This page was built for publication: Finding the edge of a Poisson forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4151050)