Sciweavers

3890 search results - page 625 / 778
» Computation of unirational fields
Sort
View
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
PAMI
1998
112views more  PAMI 1998»
15 years 6 months ago
Efficient Region Tracking With Parametric Models of Geometry and Illumination
—As an object moves through the field of view of a camera, the images of the object may change dramatically. This is not simply due to the translation of the object across the im...
Gregory D. Hager, Peter N. Belhumeur
CGF
2010
95views more  CGF 2010»
15 years 6 months ago
Polygonal Surface Advection applied to Strange Attractors
Strange attractors of 3D vector field flows sometimes have a fractal geometric structure in one dimension, and smooth surface behavior in the other two. General flow visualization...
S. Yan, N. Max, K.-L. Ma
PAMI
2007
197views more  PAMI 2007»
15 years 6 months ago
A Lattice-Based MRF Model for Dynamic Near-Regular Texture Tracking
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
Wen-Chieh Lin, Yanxi Liu