Sciweavers

16 search results - page 1 / 4
» Geodesic ham-sandwich cuts
Sort
View
CCCG
1993
14 years 6 days 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
DCG
2010
64views more  DCG 2010»
13 years 11 months ago
Generalized Ham-Sandwich Cuts
William Steiger, Jihui Zhao
ICCV
2003
IEEE
15 years 24 days ago
Computing Geodesics and Minimal Surfaces via Graph Cuts
Yuri Boykov, Vladimir Kolmogorov
COMPGEOM
2004
ACM
14 years 4 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...