Search Results for ""

A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

The polygon formed by the lines tangent to the circumcircle of a polygon. The tangential polygon of an n-gon is itself an n-gon.

By the duality principle, for every polyhedron, there exists another polyhedron in which faces and polyhedron vertices occupy complementary locations. This polyhedron is ...

A polyhedron that is dual to itself. For example, the tetrahedron is self-dual. Naturally, the skeleton of a self-dual polyhedron is a self-dual graph. Pyramids are ...

A dual bivector is defined by X^~_(ab)=1/2epsilon_(abcd)X^(cd), and a self-dual bivector by X_(ab)^*=X_(ab)+iX^~_(ab).

A number of areas of mathematics have the notion of a "dual" which can be applies to objects of that particular area. Whenever an object A has the property that it is equal ...

Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent (Harary 1994), so that one may speak of ...

A point at which two polygon edges of a polygon meet.

Given a vector bundle pi:E->M, its dual bundle is a vector bundle pi^*:E^*->M. The fiber bundle of E^* over a point p in M is the dual vector space to the fiber of E.