5 search results - page 1 / 1 » Polygon Decomposition for Efficient Construction of Minkowsk... |
ESA
2000
Springer
13 years 8 months ago
2000
Springer
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
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...
CCCG
2008
13 years 6 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
MICS
2010
12 years 11 months ago
2010
We describe the algorithms and implementation details involved in the concretizations of a generic framework that enables exact construction, maintenance, and manipulation of arran...