enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The hexagonal packing of circles on a 2-dimensional Euclidean plane. These problems are mathematically distinct from the ideas in the circle packing theorem.The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere.

  3. 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.

  4. Circle packing theorem - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_theorem

    A circle packing for a five-vertex planar graph. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are ...

  5. Smallest-circle problem - Wikipedia

    en.wikipedia.org/wiki/Smallest-circle_problem

    The algorithm selects one point p randomly and uniformly from P, and recursively finds the minimal circle containing P – {p}, i.e. all of the other points in P except p. If the returned circle also encloses p, it is the minimal circle for the whole of P and is returned. Otherwise, point p must lie on the boundary of the result circle.

  6. Menger curvature - Wikipedia

    en.wikipedia.org/wiki/Menger_curvature

    Let Π ⊆ R n be the Euclidean plane spanned by x, y and z and let C ⊆ Π be the unique Euclidean circle in Π that passes through x, y and z (the circumcircle of x, y and z). Let R be the radius of C. Then the Menger curvature c(x, y, z) of x, y and z is defined by (,,) =.

  7. Poincaré disk model - Wikipedia

    en.wikipedia.org/wiki/Poincaré_disk_model

    Poincaré disk with hyperbolic parallel lines Poincaré disk model of the truncated triheptagonal tiling.. In geometry, the Poincaré disk model, also called the conformal disk model, is a model of 2-dimensional hyperbolic geometry in which all points are inside the unit disk, and straight lines are either circular arcs contained within the disk that are orthogonal to the unit circle or ...

  8. Hypercycle (geometry) - Wikipedia

    en.wikipedia.org/wiki/Hypercycle_(geometry)

    A Poincaré disk showing the hypercycle HC that is determined by the straight line L (termed straight because it cuts the horizon at right angles) and point P. In hyperbolic geometry, a hypercycle, hypercircle or equidistant curve is a curve whose points have the same orthogonal distance from a given straight line (its axis).

  9. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions, or hypersphere packing in higher dimensions) or to non ...