365 search results - page 21 / 73 » Numerical Solving of Geometric Constraints |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy supercluster...
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
SMI
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we propose a constrained least squares approach for stably computing Laplacian deformation with strict positional constraints. In the existing work on Laplacian def...
SMI
2005
IEEE
14 years 1 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
ISPD
2000
ACM
14 years 10 days ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...