99 search results - page 4 / 20 » Inspection by Implicit Polynomials |
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
CADE
2008
Springer
14 years 11 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
PG
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we propose efficient numerical techniques for Butterworth filtering and implicit fairing of large irregular triangle meshes, where the corresponding filters are ...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f