Algorithms for Ham Sandwich Cuts

Given disjoint sets P1 P2 : : : Pd in R d with n points in total, a ham-sandwich cut is a hyperplane that simultaneously bisects the Pi. We present algorithms for nding

• Type: Conference
• Year: 1993
• Where: CCCG
• Authors: William L. Steiger
• Keywords: CCCG 1993, CCCG 2007, Ham-sandwich Cut, Sets P1 P2