When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Voronoi diagram - Wikipedia

    en.wikipedia.org/wiki/Voronoi_diagram

    A power diagram is a type of Voronoi diagram defined from a set of circles using the power distance; it can also be thought of as a weighted Voronoi diagram in which a weight defined from the radius of each circle is added to the squared Euclidean distance from the circle's center. [15]

  3. Midpoint circle algorithm - Wikipedia

    en.wikipedia.org/wiki/Midpoint_circle_algorithm

    A circle of radius 23 drawn by the Bresenham algorithm. In computer graphics, the midpoint circle algorithm is an algorithm used to determine the points needed for rasterizing a circle. It is a generalization of Bresenham's line algorithm. The algorithm can be further generalized to conic sections. [1] [2] [3]

  4. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, [1] in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like a honeycomb), and each circle is surrounded by six other circles.

  5. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]

  6. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    A circle of radius 5 centered at the origin has area 25 ... For a circle with slightly smaller radius, the area is nearly the same, but the circle contains only 69 ...

  7. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  8. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

    The area of a regular polygon is half its perimeter multiplied by the distance from its center to its sides, and because the sequence tends to a circle, the corresponding formula–that the area is half the circumference times the radius–namely, A = ⁠ 1 / 2 ⁠ × 2πr × r, holds for a circle.

  9. Equivalent radius - Wikipedia

    en.wikipedia.org/wiki/Equivalent_radius

    The area-equivalent radius of a 2D object is the radius of a circle with the same area as the object Cross sectional area of a trapezoidal open channel, red highlights the wetted perimeter, where water is in contact with the channel.