Search Results for ""

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

A curvilinear polygon built up of circular arcs. The Reuleaux polygon is a generalization of the Reuleaux triangle and, for an odd number of sides, is a curve of constant ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

A polygon whose vertices are points of a point lattice. Regular lattice n-gons exists only for n=3, 4, and 6 (Schoenberg 1937, Klamkin and Chrestenson 1963, Maehara 1993). A ...

A closed geometric figure on the surface of a sphere which is formed by the arcs of great circles. The spherical polygon is a generalization of the spherical triangle. If ...

The positions of the geometric centroid of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) are x^_ = ...

A skew polygon such that every two consecutive sides (but no three) belong to a face of a regular polyhedron. Every regular polyhedron can be orthogonally projected onto a ...

Let a convex polygon be inscribed in a circle and divided into triangles from diagonals from one polygon vertex. The sum of the radii of the circles inscribed in these ...

A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...