Housing Watch Web Search

  1. Ads

    related to: distance calculator math graph

Search results

  1. Results From The WOW.Com Content Network
  2. Euclidean distance - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance

    Euclidean distance. In mathematics, the Euclidean distance between two points in Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, and therefore is occasionally called the Pythagorean distance. These names come from the ancient Greek ...

  3. Distance from a point to a line - Wikipedia

    en.wikipedia.org/wiki/Distance_from_a_point_to_a...

    The distance (or perpendicular distance) from a point to a line is the shortest distance from a fixed point to any point on a fixed infinite line in Euclidean geometry. It is the length of the line segment which joins the point to the line and is perpendicular to the line. The formula for calculating it can be derived and expressed in several ways.

  4. Distance (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Distance_(graph_theory)

    Distance (graph theory) In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance or shortest-path distance. [1] Notice that there may be more than one shortest path between two ...

  5. Unit distance graph - Wikipedia

    en.wikipedia.org/wiki/Unit_distance_graph

    A unit distance graph with 16 vertices and 40 edges. In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some ...

  6. Distance matrix - Wikipedia

    en.wikipedia.org/wiki/Distance_matrix

    In general, a distance matrix is a weighted adjacency matrix of some graph. In a network, a directed graph with weights assigned to the arcs, the distance between two nodes of the network can be defined as the minimum of the sums of the weights on the shortest paths joining the two nodes (where the number of steps in the path is bounded). [ 2 ]

  7. Distance - Wikipedia

    en.wikipedia.org/wiki/Distance

    The Euclidean distance is the length of the displacement vector. The displacement in classical physics measures the change in position of an object during an interval of time. While distance is a scalar quantity, or a magnitude, displacement is a vector quantity with both magnitude and direction. In general, the vector measuring the difference ...

  8. Cartesian coordinate system - Wikipedia

    en.wikipedia.org/wiki/Cartesian_coordinate_system

    Cartesian coordinate system with a circle of radius 2 centered at the origin marked in red. The equation of a circle is (x − a)2 + (y − b)2 = r2 where a and b are the coordinates of the center (a, b) and r is the radius. Cartesian coordinates are named for René Descartes, whose invention of them in the 17th century revolutionized ...

  9. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    In taxicab geometry, the lengths of the red, blue, green, and yellow paths all equal 12, the taxicab distance between the opposite corners, and all four paths are shortest paths. Instead, in Euclidean geometry, the red, blue, and yellow paths still have length 12 but the green path is the unique shortest path, with length equal to the Euclidean ...

  1. Ads

    related to: distance calculator math graph