When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Meniscus (liquid) - Wikipedia

    en.wikipedia.org/wiki/Meniscus_(liquid)

    A: The bottom of a concave meniscus. B: The top of a convex meniscus. In physics (particularly fluid statics), the meniscus (pl.: menisci, from Greek 'crescent') is the curve in the upper surface of a liquid close to the surface of the container or another object, produced by surface tension.

  3. Convex position - Wikipedia

    en.wikipedia.org/wiki/Convex_position

    For instance, the traveling salesman problem, NP-hard for arbitrary sets of points in the plane, is trivial for points in convex position: the optimal tour is the convex hull. [3] Similarly, the minimum-weight triangulation of planar point sets is NP-hard for arbitrary point sets, [ 4 ] but solvable in polynomial time by dynamic programming for ...

  4. Mug - Wikipedia

    en.wikipedia.org/wiki/Mug

    A mug of coffee with cream. A mug is a type of cup, [1] a drinking vessel usually intended for hot drinks such as: coffee, hot chocolate, or tea. Mugs usually have handles and hold a larger amount of fluid than other types of cups such as teacups or coffee cups. Typically, a mug holds approximately 250–350 ml (8–12 US fl oz) of liquid. [2]

  5. Cup - Wikipedia

    en.wikipedia.org/wiki/Cup

    Mugs are informal and usually sold individually; mug holds more liquid than the cup, as the latter is used in a close proximity of a teapot anyhow. Since limiting the area of the exposed surface of the liquid helps keeping the temperature, this increase in volume is achieved through mug being taller, while tapered cups are lower for stability.

  6. Convex hull algorithms - Wikipedia

    en.wikipedia.org/wiki/Convex_hull_algorithms

    Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n , the number of input points, and sometimes also in terms of h , the number of points on the convex hull.

  7. Polyomino - Wikipedia

    en.wikipedia.org/wiki/Polyomino

    A polyomino is said to be vertically or column convex if its intersection with any vertical line is convex (in other words, each column has no holes). Similarly, a polyomino is said to be horizontally or row convex if its intersection with any horizontal line is convex. A polyomino is said to be convex if it is row and column convex. [26]

  8. Arrangement of lines - Wikipedia

    en.wikipedia.org/wiki/Arrangement_of_lines

    For each pair of lines, there can be only one cell where the two lines meet at the bottom vertex, so the number of downward-bounded cells is at most the number of pairs of lines, () /. Adding the unbounded and bounded cells, the total number of cells in an arrangement can be at most n ( n + 1 ) / 2 + 1 {\displaystyle n(n+1)/2+1} . [ 5 ]

  9. Spherical aberration - Wikipedia

    en.wikipedia.org/wiki/Spherical_aberration

    The bottom example depicts a real lens with spherical surfaces, which produces spherical aberration: The different rays do not meet after the lens in one focal point. The further the rays are from the optical axis, the closer to the lens they intersect the optical axis (positive spherical aberration). (Drawing is exaggerated.)