Search Results for ""

A polygonal diagonal is a line segment connecting two nonadjacent polygon vertices of a polygon. The number of ways a fixed convex n-gon can be divided into triangles by ...

The problem of polygon intersection seeks to determine if two polygons intersect and, if so, possibly determine their intersection. For example, the intersection of the two ...

An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...

There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...

Polykites are polyforms obtained from a regular triangular grid superposed on a regular hexagonal grid (its dual), illustrated above. The monokite is therefore a ...

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

For a given signal, the power spectrum gives a plot of the portion of a signal's power (energy per unit time) falling within given frequency bins. The most common way of ...

The term "poweroid" has at least two meanings. Sheffer sequences are sometimes called poweroids (Steffensen 1941, Shiu 1982, Di Bucchianico and Loeb 2000). Jackway and ...