Camera Position Reconstruction and Tight Direction Networks

Streinu, Ileana and Tosun, Elif (2002) Camera Position Reconstruction and Tight Direction Networks. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 372-373 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_39).

Full text not available from this repository.

Abstract

A concrete reconstruction problem arising in Computer Vision motivates our investigation of combinatorial variations on the problem of drawing a graph with given direction vectors associated to its edges. We formulate solutions in dimension 2 and report on experimental results done with simple implementations.

Item Type:Conference Paper
Additional Information:10.1007/3-540-36151-0_39
Classifications:G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.560 Geometry
ID Code:291

Repository Staff Only: item control page

References

Antone, M.E., Teller, S.: Automatic Recovery of Camera Positions in Urban Scenes. Technical Report MIT LCS TR-814. December 2000

Sugihara, K.: Detection of Structural Inconsistency in Systems of Equations with degrees of freedom and its applications. Discrete Appl. Math 10 (1985) 297-312.

Whiteley, W.: Some Matroids from Discrete Applied Geometry. Contemporary Mathematics 197 (1996)

Whiteley, W.: Rigidity and Scene Analysis. J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry, pp. 893-916