Search Results for ""

An obtuse triangle is a triangle in which one of the angles is an obtuse angle. (Obviously, only a single angle in a triangle can be obtuse or it wouldn't be a triangle.) A ...

Generally, a face is a component polygon, polyhedron, or polytope. A two-dimensional face thus has vertices and edges, and can be used to make cells. More formally, a face is ...

Nonconcurrent triangles with parallel sides are always homothetic. Homothetic triangles are always perspective triangles. Their perspector is called their homothetic center.

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

Except for convex polygons, every simple polygon has at least one mouth.

A line segment where two faces of a polyhedron meet, also called a side.

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube I=[0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...

Except for triangles, every simple polygon has at least two nonoverlapping ears.

The number of poles of an automorphic function in the closure of its fundamental region.

A tree which is not rooted, i.e., a normal tree with no node singled out for special treatment (Skiena 1990, p. 107). Free trees are sometimes known instead as unrooted trees ...