Algorithms for ham-sandwich cuts
type: Item
instance of: scholarly article
title: Algorithms for ham-sandwich cuts
zbMATH Open document ID: 0806.68061
DOI: 10.1007/BF02574017
author: Chi-Yuan Lo
author: William Steiger
author: Jiří Matoušek
published in: Discrete \& Computational Geometry
publication date: 1994-06-29T00:00:00Z
full work available at URL: https://eudml.org/doc/131310
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 598161
zbMATH Keywords: ham-sandwich cuts
Wikidata QID: Q56428477
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: Q3360902
cites work: Point Selections and Weak ε-Nets for Convex Hulls
cites work: Points and triangles in the plane and halving planes in space
cites work: A matching problem in the plane
cites work: On the expected number of \(k\)-sets
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: On k-Hulls and Related Problems
cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
cites work: Q3772828
cites work: Edge-skeletons in arrangements with applications
cites work: Computing a ham-sandwich cut in two dimensions
cites work: Constructing Belts in Two-Dimensional Arrangements with Applications
cites work: Construction of \(\epsilon\)-nets
cites work: Randomized optimal algorithm for slope selection
cites work: Partitioning with two lines in the plane
cites work: An upper bound on the number of planar \(K\)-sets
cites work: Polygon Retrieval
cites work: The colored Tverberg's problem and complexes of injective functions
description: scientific article; zbMATH DE number 598161