Sciweavers

16 search results - page 1 / 4
» Geodesic ham-sandwich cuts
Sort
View
93
Voted
CCCG
1993
14 years 11 months ago
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
William L. Steiger
62
Voted
DCG
2010
64views more  DCG 2010»
14 years 10 months ago
Generalized Ham-Sandwich Cuts
William Steiger, Jihui Zhao
81
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
Geodesic ham-sandwich cuts
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, J...