ArchitectureVisualization3D ModelingComputational GeometryGeometric ModelingGeometry ProcessingReflectance ModelingShading ModelsShape RepresentationSurface Reconstruction3D Surface ModelingConvex PolyhedraPhysically Based Reflectance ModelsReflectanceReflectance Reconstruction
Following Sugihara, we represent the geometric constraints imposed by the line-drawing of a polyhedron as a set of linear equalities and inequalities. Unlike him, we explicitly take into account the uncertainty in vertex position. This allows us to circumvent the superstrictness of the constraints without deleting any of them. For a given error bound, deciding whether a line-drawing is the correct projection of a polyhedron is reduced to linear programming, and 3D shape recovery is reduced to optimization under linear constraints. Our method can be used for recovering the shape of polyhedral objects whose reflectance can be modelled accurately. We have implemented if for the Lambertian model and the Lambertian model with interreflections. We present results obtained using real images.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
18
Linear and nonlinear programming.
Mathematics and Computers in Simulation · 1986 · 4.9K citations
The psychology of computer vision
Azriel Rosenfeld · Artificial Intelligence · 1976 · 3K citations
Understanding Line drawings of Scenes with Shadows
David L. Waltz · 1975 · 880 citations
Mark Clowes · Artificial Intelligence · 1971 · 678 citations
Michael F. Cohen, Donald P. Greenberg · ACM SIGGRAPH Computer Graphics · 1985 · 558 citations