Algorithms for ham-sandwich cuts
From MaRDI portal
Recommendations
Cites work
- A matching problem in the plane
- A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
- An Optimal-Time Algorithm for Slope Selection
- An upper bound on the number of planar K-sets
- Computing a ham-sandwich cut in two dimensions
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Construction of \(\epsilon\)-nets
- Edge-skeletons in arrangements with applications
- scientific article; zbMATH DE number 4214050 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- On k-Hulls and Related Problems
- On the expected number of k-sets
- Partitioning with two lines in the plane
- Point Selections and Weak ε-Nets for Convex Hulls
- Points and triangles in the plane and halving planes in space
- Polygon Retrieval
- Randomized optimal algorithm for slope selection
- Sorting in \(c \log n\) parallel steps
- The colored Tverberg's problem and complexes of injective functions
Cited in
(55)- Dynamic ham-sandwich cuts in the plane
- Small weak epsilon-nets
- Computing a ham-sandwich cut in two dimensions
- Bisections and ham-sandwich cuts of convex polygons and polyhedra
- On the expected number of k-sets
- Illumination by floodlights
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Linear transformation distance for bichromatic matchings
- New challenges in dynamic load balancing
- Equipartition of mass distributions by hyperplanes
- Bisecting envelopes of convex polygons
- Geometric systems of unbiased representatives
- Ham-sandwich cuts and center transversals in subspaces
- Bisecting three classes of lines
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Extreme point and halving edge search in abstract order types
- Algorithms for bivariate zonoid depth
- An optimal randomized algorithm for \(d\)-variate zonoid depth
- Equitable subdivisions within polygonal regions
- A robust algorithm for bisecting a triconnected graph with two resource sets
- A semi-algebraic version of Zarankiewicz's problem
- Discrete geometry on colored point sets in the plane -- a survey
- On geometric graphs on point sets in the plane
- Few cuts meet many point sets
- Halving balls in deterministic linear time
- scientific article; zbMATH DE number 5999585 (Why is no real title available?)
- SEPARATING SETS OF HYPERRECTANGLES
- scientific article; zbMATH DE number 4213450 (Why is no real title available?)
- Halving balls by a hyperplane in deterministic linear time
- An optimal algorithm for plane matchings in multipartite geometric graphs
- scientific article; zbMATH DE number 4090793 (Why is no real title available?)
- Reprint of: Extreme point and halving edge search in abstract order types
- Computing generalized ham-sandwich cuts
- On the complexity of the pancake problem
- Practical low-dimensional halfspace range space sampling
- A survey of mass partitions
- Packing 1-plane Hamiltonian cycles in complete geometric graphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Geodesic ham-sandwich cuts
- Orthogonal ham-sandwich theorem in \(\mathbb{R}^3\)
- Weighted Ham-Sandwich Cuts
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
- scientific article; zbMATH DE number 7662165 (Why is no real title available?)
- Cubic plane graphs on a given point set
- Generalized ham-sandwich cuts
- New variants of perfect non-crossing matchings
- A stronger conclusion to the classical ham sandwich theorem
- Some geometric lower bounds
- Separating collections of points in Euclidean spaces
- Computational complexity of the -Ham-Sandwich problem
- Eight-partitioning points in 3D, and efficiently too
- New variants of perfect non-crossing matchings
- Geodesic ham-sandwich cuts
- Uneven splitting of ham sandwiches
- Bisecting a 4-connected graph with three resource sets
This page was built for publication: Algorithms for ham-sandwich cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329191)
