Search Results for ""

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

An illusion is an object or drawing which appears to have properties which are physically impossible, deceptive, or counterintuitive. Kitaoka maintains a web page of ...

What space-filling arrangement of similar cells of equal volume has minimal surface area? This questions arises naturally in the theory of foams when the liquid content is ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...

The snub dodecahedron is an Archimedean solid consisting of 92 faces (80 triangular, 12 pentagonal), 150 edges, and 60 vertices. It is sometimes called the dodecahedron simum ...

Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

Picking two independent sets of points x and y from a unit uniform distribution and placing them at coordinates (x,y) gives points uniformly distributed over the unit square. ...