Generalized ham-sandwich cuts
From MaRDI portal
Publication:603848
Recommendations
- Algorithms for ham-sandwich cuts
- Computing generalized ham-sandwich cuts
- Weighted Ham-Sandwich Cuts
- Equitable subdivisions within polygonal regions
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
- Generalizing ham sandwich cuts to equitable subdivisions
- Few cuts meet many point sets
- Computing balanced convex partitions of lines
- scientific article; zbMATH DE number 4090793
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- A positive fraction Erdős-Szekeres theorem
- Algorithms for ham-sandwich cuts
- An improved bound for \(k\)-sets in three dimensions
- Equipartitions of measures by 2-fans
- Improved bounds for planar \(k\)-sets and related problems
- Partitioning with two lines in the plane
- Simultaneous partitions of measures by \(k\)-fans
- Slicing convex sets and measures by a hyperplane
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Supporting spheres for families of independent convex sets
- 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
- \(k\)-sets in four dimensions
Cited in
(19)- Dynamic ham-sandwich cuts in the plane
- Generalizing ham sandwich cuts to equitable subdivisions
- Uneven splitting of ham sandwiches
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- scientific article; zbMATH DE number 7662165 (Why is no real title available?)
- A superlinear lower bound on the number of 5-holes
- Computing generalized ham-sandwich cuts
- Algorithms for ham-sandwich cuts
- On separating points by lines
- Few cuts meet many point sets
- Weighted Ham-Sandwich Cuts
- Geodesic ham-sandwich cuts
- Ham-sandwich cuts and center transversals in subspaces
- Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
- A stronger conclusion to the classical ham sandwich theorem
- No-dimensional Tverberg theorems and algorithms
- Stabbing simplices of point sets with \(k\)-flats
- Bisecting envelopes of convex polygons
- A survey of mass partitions
This page was built for publication: Generalized ham-sandwich cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603848)
