Document
Generically Dependent Continuant
RDF description of Large convex holes in random point sets - http://orbis.uaslp.mx/vivo/individual/scopus3476
Article
A convex hole (or empty convex polygon) of a point set P in the plane is a convex polygon with vertices in P, containing no points of P in its interior. Let R be a bounded convex region in the plane. We show that the expected number of vertices of the largest convex hole of a set of n random points chosen independently and uniformly over R is Θ(logn/(loglogn)), regardless of the shape of R. © 2012 Elsevier B.V.
Convex hole; Erdős–Szekeres Theorem; Random point set Applications; Computational geometry; Convex hole; Convex polygon; nocv1; Point set; Random point set; Random points; Geometry
Information Content Entity
Computational Geometry: Theory and Applications