Generalized ham-sandwich cuts

DOI10.1007/s00454-009-9225-8zbMath1206.52008OpenAlexW2047989004MaRDI QIDQ603848

William Steiger, Jihui Zhao

Publication date: 8 November 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9225-8

zbMATH Keywords

ham-sandwich cutsrunning time of algorithmweak general positionwell-separated family of sets

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (10)

Bisecting envelopes of convex polygons ⋮ A survey of mass partitions ⋮ Unnamed Item ⋮ Computing generalized ham-sandwich cuts ⋮ Few cuts meet many point sets ⋮ A stronger conclusion to the classical ham sandwich theorem ⋮ On separating points by lines ⋮ A superlinear lower bound on the number of 5-holes ⋮ STABBING SIMPLICES OF POINT SETS WITH k-FLATS ⋮ No-dimensional Tverberg theorems and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• \(k\)-sets in four dimensions
• Algorithms for ham-sandwich cuts
• A positive fraction Erdős-Szekeres theorem
• Improved bounds for planar \(k\)-sets and related problems
• Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
• Slicing convex sets and measures by a hyperplane
• Equipartitions of measures by 2-fans
• Supporting spheres for families of independent convex sets
• Partitioning with two lines in the plane
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Simultaneous partitions of measures by \(k\)-fans
• An improved bound for \(k\)-sets in three dimensions

This page was built for publication: Generalized ham-sandwich cuts