Search Results for ""

The term "Cartesian" is used to refer to anything that derives from René Descartes' conception of geometry (1637), which is based on the representation of points in the plane ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

A generalization of Grassmann coordinates to m-D algebraic varieties of degree d in P^n, where P^n is an n-dimensional projective space. To define the Chow coordinates, take ...

The circumtangential triangle is an equilateral triangle formed by the three points X on the circumcircle of a reference triangle DeltaABC at which the line XX^(-1), where ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

A map projection which is a conformal mapping, i.e., one for which local (infinitesimal) angles on a sphere are mapped to the same angles in the projection. On maps of an ...

A general mathematical property obeyed by mathematical objects in which all elements are within a neighborhood of nearby points. The continuous maps between topological ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

A system for specifying points using coordinates measured in some specified way. The simplest coordinate system consists of coordinate axes oriented perpendicularly to each ...