An infinite sequence of non-realizable weavings

AbstractA weaving is a number of lines drawn in the plane so that no three lines intersect at a point, and the intersections are drawn so as to show which of the two lines is above the other. For each integer n⩾4 we construct a weaving of n lines, which is not realizable as a projection of a number of lines in 3-space, all of whose subfigures are realizable as such projections

Shape-from-image via cross-sections

International Conference on Pattern Recognition (ICPR), 2000, Barcelona (España)Using structural geometry, Whiteley (1991) showed that a line drawing is a correct projection of a spherical polyhedron if and only if it has a cross-section compatible with it. We extend the class of drawings to which this test applies, including those of polyhedral disks. Our proof is constructive, showing how to derive all spatial interpretations; it relies on elementary synthetic geometric arguments, and, as a by-product, it yields a simpler and shorter proof of Whiteley's result. Moreover, important properties of line drawings are visually derived as corollaries: realizability is independent of the adopted projection, it is an invariant projective property, and for trihedral drawings it can be checked with a pencil and an unmarked ruler alone.Peer Reviewe

Shape-from-Image via Cross-Sections

Abstrac

Lifting symmetric pictures to polyhedral scenes

Scene analysis is concerned with the reconstruction of d-dimensional objects, such as polyhedral surfaces, from (d − 1)-dimensional pictures (i.e., projections of the objects onto a hyperplane). In this paper we study the impact of symmetry on the lifting properties of pictures. We first use methods from group representation theory to show that the lifting matrix of a symmetric picture can be transformed into a block-diagonalized form. Using this result we then derive new symmetry-extended counting conditions for a picture with a non-trivial symmetry group in an arbitrary dimension to be minimally flat (i.e., ‘non-liftable’). These conditions imply very simply stated restrictions on the number of those structural components of the picture that are fixed by the various symmetry operations of the picture. We then also transfer lifting results for symmetric pictures from Euclidean (d − 1)-space to Euclidean d-space via the technique of coning. Finally, we offer some conjectures regarding sufficient conditions for a picture realized generically for a symmetry group to be minimally flat