TOPICS
Search

Search Results for ""


561 - 570 of 923 for Euclidean AlgorithmSearch Results
A geometric implement discovered in a 19th century book, and whose inventor is unknown. It essentially consists of a semicircle, a segment SR which prolongs its diameter and ...
A topological space M satisfying some separability (i.e., it is a T2-space) and countability (i.e., it is a paracompact space) conditions such that every point p in M has a ...
A Tucker hexagon is a hexagon inscribed in a reference triangle that has sides which are alternately parallel and antiparallel to the corresponding sides of the triangle. ...
A distance graph with distance set (0,1].
Given an n-dimensional vector x=[x_1; x_2; |; x_n], (1) a general vector norm |x|, sometimes written with a double bar as ||x||, is a nonnegative norm defined such that 1. ...
The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...
A weak pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, g_m(v_m,w_m)=0 for all w_m in T_mM implies ...
A weak Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a weak pseudo-Riemannian metric and positive definite. In a very precise way, the ...
Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
1 ... 54|55|56|57|58|59|60 ... 93 Previous Next

...