When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Mean line segment length - Wikipedia

    en.wikipedia.org/wiki/Mean_line_segment_length

    The average chord length between points on the circumference of a circle of radius r is [8] 4 π r ≈ 1.273239544 … r {\displaystyle {\frac {4}{\pi }}r\approx 1.273239544\ldots r} And picking points on the surface of a sphere with radius r is [ 9 ]

  3. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    () is roughly , the area inside a circle of radius . This is because on average, each unit square contains one lattice point. This is because on average, each unit square contains one lattice point. Thus, the actual number of lattice points in the circle is approximately equal to its area, π r 2 {\displaystyle \pi r^{2}} .

  4. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    The most efficient way to pack different-sized circles together is not obvious. In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap.

  5. Circle packing theorem - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_theorem

    Circle packings can be used to approximate conformal mappings between specified domains. Each circle on the left corresponds to a circle on the right. A conformal map between two open sets in the plane or in a higher-dimensional space is a continuous function from one set to the other that preserves the angles between any two

  6. Euler's theorem in geometry - Wikipedia

    en.wikipedia.org/wiki/Euler's_theorem_in_geometry

    In geometry, Euler's theorem states that the distance d between the circumcenter and incenter of a triangle is given by [1] [2] = or equivalently + + =, where and denote the circumradius and inradius respectively (the radii of the circumscribed circle and inscribed circle respectively).

  7. Goat grazing problem - Wikipedia

    en.wikipedia.org/wiki/Goat_grazing_problem

    Because the "sweep" of the area under the involute is bounded by a tangent line (see diagram and derivation below) which is not the boundary (¯) between overlapping areas, the decomposition of the problem results in four computable areas: a half circle whose radius is the tether length (A 1); the area "swept" by the tether over an angle of 2 ...

  8. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    A large L1-distance between the two vectors indicates a significant difference in the nature of the distributions while a small distance denotes similarly shaped distributions. This is equivalent to measuring the area between the two distribution curves because the area of each segment is the absolute difference between the two curves ...

  9. Distance of closest approach - Wikipedia

    en.wikipedia.org/wiki/Distance_of_closest_approach

    The distance of closest approach is sometimes referred to as the contact distance. For the simplest objects, spheres, the distance of closest approach is simply the sum of their radii. For non-spherical objects, the distance of closest approach is a function of the orientation of the objects, and its calculation can be difficult.