Sciweavers

1604 search results - page 64 / 321
» Approximation algorithms for developable surfaces
Sort
View
IJRR
2000
121views more  IJRR 2000»
13 years 8 months ago
Reconstructing the Shape of a Deformable Membrane from Image Data
In this paper, we study the problem of determining a mathematical description of the surface defined by the shape of a membrane based on an image of it and present an algorithm fo...
Nicola J. Ferrier, Roger W. Brockett
SIGGRAPH
2000
ACM
14 years 1 months ago
Normal meshes
Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offse...
Igor Guskov, Kiril Vidimce, Wim Sweldens, Peter Sc...
IJCV
2002
256views more  IJCV 2002»
13 years 8 months ago
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maxim...
Changming Sun
JAT
2007
84views more  JAT 2007»
13 years 8 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
EURONGI
2005
Springer
14 years 2 months ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...