Many empty triangles have a common edge
From MaRDI portal
Publication:2391838
Abstract: Given a finite point set in the plane, the degree of a pair is the number of empty triangles , where empty means . Define as the maximal degree of a pair in . Our main result is that if is a random sample of independent and uniform points from a fixed convex body, then in expectation.
Recommendations
Cites work
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- scientific article; zbMATH DE number 1786502 (Why is no real title available?)
- scientific article; zbMATH DE number 881170 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Multidimensional Sorting
- Planar point sets with a small number of empty convex polygons
- Research Problems in Discrete Geometry
Cited in
(7)- Moments of the maximal number of empty simplices of a random point set
- Many triangles with few edges
- Limit theory for the Gilbert graph
- Stars of empty simplices
- Growth rates of the number of empty triangles and simplices
- A note on the number of general 4-holes in (perturbed) grids
- Growth rate of the number of empty triangles in the plane
This page was built for publication: Many empty triangles have a common edge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391838)