Search Results for ""

A number of points on a line segment. The term was first used by Desargues (Cremona 1960, p. x). If the points A, B, C, ... lie on a line segment with the coordinates of the ...

The vertical line test is a graphical method of determining whether a curve in the plane represents the graph of a function by visually examining the number of intersections ...

Consider the distribution of distances l between a point picked at random in the interior of a unit cube and on a face of the cube. The probability function, illustrated ...

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

An accumulation point is a point which is the limit of a sequence, also called a limit point. For some maps, periodic orbits give way to chaotic ones beyond a point known as ...

The intersection Ev of the Gergonne line and the Euler line. It has triangle center function alpha=(b(a-b+c)cosB+c(a+b-c)cosC-2a^2cosA)/(2a) and is Kimberling center X_(1375).

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

A point, such as interior points of a disk, such that (px)(py)=[const], where p is the chord length.

Also known as the first fundamental form, ds^2=g_(ab)dx^adx^b. In the principal axis frame for three dimensions, ds^2=g_(11)(dx^1)^2+g_(22)(dx^2)^2+g_(33)(dx^3)^2. At ...