Sciweavers

13 search results - page 3 / 3
» Enumerating Triangulations of Convex Polytopes
Sort
View
DCG
2008
101views more  DCG 2008»
13 years 6 months ago
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...
Hans Raj Tiwary
DCG
2010
171views more  DCG 2010»
13 years 6 months ago
Bregman Voronoi Diagrams
The Voronoi diagram of a point set is a fundamental geometric structure that partitions the space into elementary regions of influence defining a discrete proximity graph and dual...
Jean-Daniel Boissonnat, Frank Nielsen, Richard Noc...
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
13 years 6 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight