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.
Research partially supportedb y the first author’s NSF RUI grant CCR-0105507. Part of the work was conducted during the Workshop
on Rigidity Theory and Scene Analysis, organizedb y the first author at McGill University Bellairs Institute in Barbados in
Jan. 2002, with partial support from NSF grant CCR-0203224.