Given a combinatorial type of a convex polytope, what techniques are available for showing that it cannot be realized as a Voronoi cell of some point system?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
2
|
||||||||||||||||||||
|
|
7
|
Every (non flat) convex polytope is the Voronoi cell of a point in a set of point. Constructive proof: pick a point inside the polytope, and build its symmetric reflection along every facet of the polytope. |
||
|
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
0
|
There is this paper of Boissonnat and Karavelas where they prove bounds on the combinatorial convexity of Voronoi cells. Presumably if your polytope does not satisfy the bound, it is not a Voronoi cell.. |
|||||
|

