Families of m-convex polygons: m = 2

Details Families of m-convex polygons: m = 2 Families of m-convex polygons: m = 2

2007-10-25

arxiv.org/abs/0710.4606v1

Mathematics

Combinatorics

53 pages

Scientific paper

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by having up to $m$ 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.

Affiliated with

Also associated with

No associations

Rating

Families of m-convex polygons: m = 2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Families of m-convex polygons: m = 2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Families of m-convex polygons: m = 2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431285