273 search results - page 36 / 55 » A Geometric Proof of Calibration |
115
click to vote
ICCV
1999
IEEE
16 years 12 days ago
1999
IEEE
We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal i...
DIAGRAMS
2000
Springer
15 years 2 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...
DGCI
2006
Springer
15 years 2 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
107
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...