Sciweavers

235 search results - page 20 / 47
» The Complexity of Separating Points in the Plane
Sort
View
PRL
2010
173views more  PRL 2010»
14 years 8 months ago
Resolving stereo matching errors due to repetitive structures using model information
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
Björn Barrois, Marcus Konrad, Christian W&oum...
74
Voted
ICCV
2005
IEEE
15 years 11 months ago
Dynamic Refraction Stereo
In this paper we consider the problem of reconstructing the 3D position and surface normal of points on an unknown, arbitrarily-shaped refractive surface. We show that two viewpoi...
Nigel J. W. Morris, Kiriakos N. Kutulakos
85
Voted
CGF
2008
109views more  CGF 2008»
14 years 9 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
DIS
2007
Springer
15 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
GIS
2008
ACM
14 years 10 months ago
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
Bart Kuijpers, Bart Moelans