895 search results - page 20 / 179 » Approximate convex decomposition |
IPL
2002
14 years 9 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
ESA
2000
Springer
15 years 1 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...
82
Voted
SIAMMAX
2010
14 years 4 months ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
JSC
2008
14 years 9 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
IJON
2002
14 years 9 months ago
2002
It was discovered recently that sparse decomposition by signal dictionaries results in dramatic improvement of the qualities of blind source separation. We exploit sparse decompos...