Search Results for ""

A polyhedron dissection (or decomposition) is a dissection of one or more polyhedra into other shapes. Two polyhedra can be dissected into each other iff they have equal Dehn ...

The field of all rational and irrational numbers is called the real numbers, or simply the "reals," and denoted R. The set of real numbers is also called the continuum, ...

A zonotope is a set of points in d-dimensional space constructed from vectors v_i by taking the sum of a_iv_i, where each a_i is a scalar between 0 and 1. Different choices ...

Every totally ordered set (A,<=) is associated with a so-called order type. Two sets A and B are said to have the same order type iff they are order isomorphic (Ciesielski ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...