\(k\)-sets and random hulls

DOI10.1007/BF01303520zbMath0794.52006OpenAlexW2040253224MaRDI QIDQ1316654

Micha Sharir

Publication date: 22 August 1994

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01303520

zbMATH Keywords

\(k\)-setsDelaunay triangulationsrandom hulls

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Random convex sets and integral geometry (aspects of convex geometry) (52A22)

Related Items (1)

Efficient algorithms for maximum regression depth

Cites Work

• Unnamed Item
• On the number of k-subsets of a set of n points in the plane
• The number of small semispaces of a finite set of points in the plane
• Points and triangles in the plane and halving planes in space
• On \(k\)-sets in arrangements of curves and surfaces
• Randomized incremental construction of Delaunay and Voronoi diagrams
• On the number of line separations of a finite set in the plane
• Applications of random sampling in computational geometry. II

This page was built for publication: \(k\)-sets and random hulls