Results 1  10
of
43
Geodesic HamSandwich Cuts
 In Proceedings of the Japan Conference on Discrete and Computational Geometry (JCDCG 2004), volume 3742 of LNCS
, 2004
"... 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 hamsandwich geodesic is a shortest path in P between any two points on the boundary of P that simultaneously bisects the red points and the blue p ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
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 hamsandwich geodesic is a shortest path in P between any two points on the boundary of P that simultaneously bisects the red points and the blue
Generalized HamSandwich Cuts
 DISCRETE COMPUT GEOM
, 2009
"... ... convex bodies S1,...,Sd in R d and constants βi ∈[0, 1], there exists a unique hyperplane h with the property that Vol(h + ∩ Si) = βi · Vol(Si); h + is the closed positive transversal halfspace of h, and h is a “generalized hamsandwich cut. ” We give a discrete analogue for a set S of n points ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
... convex bodies S1,...,Sd in R d and constants βi ∈[0, 1], there exists a unique hyperplane h with the property that Vol(h + ∩ Si) = βi · Vol(Si); h + is the closed positive transversal halfspace of h, and h is a “generalized hamsandwich cut. ” We give a discrete analogue for a set S of n
Uneven splitting of ham sandwiches
 Discrete & Computational Geometry
"... Let µ1,..., µn be continuous probability measures on Rn and α1,..., αn ∈ [0, 1]. When does there exist an oriented hyperplane H such that the positive halfspace H+ has µi(H+) = αi for all i ∈ [n]? It is well known that such a hyperplane does not exist in general. The famous ham sandwich theorem st ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Let µ1,..., µn be continuous probability measures on Rn and α1,..., αn ∈ [0, 1]. When does there exist an oriented hyperplane H such that the positive halfspace H+ has µi(H+) = αi for all i ∈ [n]? It is well known that such a hyperplane does not exist in general. The famous ham sandwich theorem
Dynamic HamSandwich Cuts in the Plane
, 2005
"... We design efficient data structures for dynamically maintaining a hamsandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A hamsandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our first ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We design efficient data structures for dynamically maintaining a hamsandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A hamsandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our
Constructing HamSandwich Cuts in the Plane
"... In continuation of the necklace splitting / hamsandwich cut problem... However, knowing about the existence of such a line certainly is not good enough. It is easy to turn the proof given above into an O(n2) algorithm to construct a line that simultaneously bisects both sets. But we can do better. ..."
Abstract
 Add to MetaCart
In continuation of the necklace splitting / hamsandwich cut problem... However, knowing about the existence of such a line certainly is not good enough. It is easy to turn the proof given above into an O(n2) algorithm to construct a line that simultaneously bisects both sets. But we can do better
Generalizing Ham Sandwich Cuts to Equitable Subdivisions
, 1998
"... We prove a generalization of famous Ham Sandwich Theorem for the plane. Given gn red points and gm blue points in the plane in general position, there exists a subdivision of the plane into g disjoint convex polygons, each of which contains n red points and m blue points. For g = 2 this problem is ..."
Abstract

Cited by 34 (1 self)
 Add to MetaCart
We prove a generalization of famous Ham Sandwich Theorem for the plane. Given gn red points and gm blue points in the plane in general position, there exists a subdivision of the plane into g disjoint convex polygons, each of which contains n red points and m blue points. For g = 2 this problem
Results 1  10
of
43