Families of m-convex polygons: m = 2
From MaRDI portal
Publication:6207260
arXiv0710.4606MaRDI QIDQ6207260FDOQ6207260
Anthony J Guttmann, W. R. G. James, I. Jensen
Publication date: 24 October 2007
Abstract: Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', . Such polygons are called emph{-convex} polygons and are characterised by having up to indentations in the side. We use a `divide and conquer' approach, factorising 2-convex polygons by extending a line along the base of its indents. We then use the inclusion-exclusion principle, the Hadamard product and extensions to known methods to derive the generating functions for each case.
This page was built for publication: Families of m-convex polygons: m = 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6207260)
