7 search results - page 1 / 2 » Exact and Efficient Construction of Planar Minkowski Sums Us... |
ESA
2006
Springer
13 years 8 months ago
2006
Springer
CGF
2010
13 years 4 months ago
2010
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
SMA
2010
ACM
13 years 5 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
JMLR
2010
12 years 11 months ago
2010
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
JACM
2000
13 years 4 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...