In geometry, the midpoint polygon of a polygon P is the polygon whose vertices are the midpoints of the edges of P. It is sometimes called the Kasner polygon after Edward Kasner, who termed it the inscribed polygon "for brevity".
In geometry, a covering of a polygon is a set of primitive units whose union equals the polygon. A polygon covering problem is a problem of finding a covering with...
In geometry, the midpoint-stretching polygon of a cyclic polygon P is another cyclic polygon inscribed in the same circle, the polygon whose vertices are the midpoints of the circular arcs...
In geometry, a partition of a polygon is a set of primitive units , which do not overlap and whose union equals the polygon. A polygon partition problem is a...
In computational geometry, the visibility polygon or visibility region for a point p in the plane among obstacles is the possibly unbounded polygonal region of all points of the plane...
In discrete geometry and computational geometry, the convex hull of a simple polygon is the polygon of minimum perimeter that contains a given simple polygon. It is a special case...
