Dynamic ham-sandwich cuts in the plane

DOI10.1016/j.comgeo.2008.09.008zbMath1181.65029OpenAlexW2102891664MaRDI QIDQ1025301

Kathryn Seyboth, Vincent Yeung, John Hugg, Jelani Nelson, Stefan Langerman, Erik D. Demaine, Michael A. Burr, Timothy M. Chan, Martin L. Demaine, Eynat Rafalin, Timothy G. Abbott, Daniel M. Kane

Publication date: 18 June 2009

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/96191

zbMATH Keywords

algorithmsdata structurescomputational geometrybisectorspolygonspoint setsham-sandwich theorem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

A survey of mass partitions ⋮ On the Complexity of the Pancake Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Bisections and ham-sandwich cuts of convex polygons and polyhedra
• Reporting points in halfspaces
• Efficient partition trees
• Algorithms for ham-sandwich cuts
• On the complexity of halfspace area queries
• Dynamic half-space range reporting and its applications
• Generalized sandwich theorems
• Ray Shooting and Parametric Search
• Partitioning with two lines in the plane
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On k-Hulls and Related Problems
• Computational Geometry in C
• Solving a Polynomial Equation: Some History and Recent Progress
• Counting the onion
• The Early History of the Ham Sandwich Theorem
• Slowing down sorting networks to obtain faster sorting algorithms
• Geodesic ham-sandwich cuts
• Weighted Ham-Sandwich Cuts

This page was built for publication: Dynamic ham-sandwich cuts in the plane