4850 search results - page 103 / 970 » Proof and Computation in Geometry |
195
click to vote
SAT
2009
Springer
16 years 27 days ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
197
click to vote
SI3D
2005
ACM
15 years 12 months ago
2005
ACM
We present a simple yet effective snapping technique for constraining the motion of the cursor of an input device to the surface of 3D models whose geometry is arbitrarily deforme...
176
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
In this work we investigate an inverse geometry problem. Given a light source, a diffuse plane and a caustic image, how must a geometric object look like (transmissive or reflect...
184
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
175
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We study the epipolar geometry between views acquired by mixtures of central projection systems including catadioptric sensors and cameras with lens distortion. Since the projecti...