TOPICS
Search

Search Results for ""


651 - 660 of 2674 for Distance Between PointsSearch Results
A cylindrical wedge, also called a cylindrical hoof or cylindrical ungula, is a wedge cut from a cylinder by slicing with a plane that intersects the base of the cylinder. ...
A second-order algebraic surface given by the general equation (1) Quadratic surfaces are also called quadrics, and there are 17 standard-form types. A quadratic surface ...
The Roman surface, also called the Steiner surface (not to be confused with the class of Steiner surfaces of which the Roman surface is a particular case), is a quartic ...
Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...
The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...
A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...
A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...
The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u,v) of a directed or undirected graph. The length of the ...
The taxicab metric, also called the Manhattan distance, is the metric of the Euclidean plane defined by g((x_1,y_1),(x_2,y_2))=|x_1-x_2|+|y_1-y_2|, for all points ...
The tritetrahedron, also called the "boat polyhedron," is the name given in this work to the concave (non-regular) octahedron formed by joining three regular tetrahedra ...
1 ... 63|64|65|66|67|68|69 ... 268 Previous Next

...