Kaszanitzky, Viktoria Eszter and Schulze, Bernd (2018) Characterizing minimally flat symmetric hypergraphs. Discrete Applied Mathematics, 236. pp. 256-269. ISSN 0166-218X
sym_scene_analysis_REV31_10_17.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial-NoDerivs.
Download (396kB)
Abstract
In Kaszanitzky and Schulze (2017) we gave necessary conditions for a symmetric d-picture (i.e., a symmetric realization of an incidence structure in Rd) to be minimally flat, that is, to be non-liftable to a polyhedral scene without having redundant constraints. These conditions imply very simply stated restrictions on the number of those structural components of the picture that are fixed by the elements of its symmetry group. In this paper we show that these conditions on the fixed structural components, together with the standard non-symmetric counts, are also sufficient for a plane picture which is generic with three-fold rotational symmetry C3 to be minimally flat. This combinatorial characterization of minimally flat C3-generic pictures is obtained via a new inductive construction scheme for symmetric sparse hypergraphs. We also give a sufficient condition for sharpness of pictures with C3 symmetry.