121 search results - page 13 / 25 » Codegree problems for projective geometries |
COMPGEOM
2003
ACM
14 years 24 days ago
2003
ACM
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
IBPRIA
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. This paper addresses the problem of reconstructing textureless objects of quadric like shape. It is known that a quadric can be uniquely recovered from its apparent conto...
COMPGEOM
2003
ACM
14 years 24 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
This paper addresses the problem of estimating the 3D shape of a smooth textureless solid from multiple images acquired under orthographic projection from unknown and unconstrained...
Publication
Most conventional SFS (shape from shading) algorithms have been developed under three basic assumptions on surface properties and imaging geometry to simplify the problem, namely, ...