Document
type: Class

Continuant
type: Class

Entity
type: Class

Generically Dependent Continuant
type: Class

RDF description of Large convex holes in random point sets - http://orbis.uaslp.mx/vivo/individual/scopus3476
rights: termsOfUse
date: 2026-08-27T08:17:21
publisher: vivo
type: Document

Article
type: Class

Large convex holes in random point sets
related by: authorship_20056
doi: 10.1016/j.comgeo.2012.11.004
type: Document
page end: 733
volume: 46
has publication venue: Computational Geometry: Theory and Applications
issue: 6
type: Information Content Entity
type: Entity
most specific type: Article
type: Article
estado: published
most specific type: Document
date time value: article date 3477
crisid: 3477
related by: authorship_20057
type: Generically Dependent Continuant
abstract: 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.
type: Thing
page start: 725
related by: authorship_20058
freetext keyword: 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
e iscopus: 2-s2.0-84992521744
origen: scopus
accesstype: All Open Access, Bronze, Green
type: Continuant

Information Content Entity
type: Class

Computational Geometry: Theory and Applications
type: Continuant
type: Collection
type: Information Content Entity
publication venue for: Large convex holes in random point sets
type: Thing
type: Generically Dependent Continuant
type: Periodical
type: Journal
type: Document
type: Entity