When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Alhazen's problem - Wikipedia

    en.wikipedia.org/wiki/Alhazen's_problem

    Alhazen's problem, also known as Alhazen's billiard problem, is a mathematical problem in geometrical optics first formulated by Ptolemy in 150 AD. [1] It is named for the 11th-century Arab mathematician Alhazen ( Ibn al-Haytham ), who presented a geometric solution in his Book of Optics .

  3. Scan-Line Interleave - Wikipedia

    en.wikipedia.org/wiki/Scan-Line_Interleave

    The original Voodoo Graphics card and the VSA-100 [3] [4] were also SLI-capable. However, in the case of the former, it was only used in arcades [ 5 ] [ 6 ] , as well as professional applications via Primary Image's Piranha [ 7 ] [ 8 ] [ 9 ] card, intended for use with simulations using various [ 10 ] [ 11 ] graphics APIs such as OpenGL, Glide ...

  4. Obstacle problem - Wikipedia

    en.wikipedia.org/wiki/Obstacle_problem

    The obstacle problem is a classic motivating example in the mathematical study of variational inequalities and free boundary problems.The problem is to find the equilibrium position of an elastic membrane whose boundary is held fixed, and which is constrained to lie above a given obstacle.

  5. List of unsolved problems in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_unsolved_problems...

    Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.

  6. Collatz conjecture - Wikipedia

    en.wikipedia.org/wiki/Collatz_conjecture

    less than 10 4 is 6171, which has 261 steps, less than 10 5 is 77 031, which has 350 steps, less than 10 6 is 837 799, which has 524 steps, less than 10 7 is 8 400 511, which has 685 steps, less than 10 8 is 63 728 127, which has 949 steps, less than 10 9 is 670 617 279, which has 986 steps, less than 10 10 is 9 780 657 630, which has 1132 ...

  7. Bresenham's line algorithm - Wikipedia

    en.wikipedia.org/wiki/Bresenham's_line_algorithm

    (0,0) is at the top left corner of the grid, (1,1) is at the top left end of the line and (11, 5) is at the bottom right end of the line. The following conventions will be applied: the top-left is (0,0) such that pixel coordinates increase in the right and down directions (e.g. that the pixel at (7,4) is directly above the pixel at (7,5)), and

  8. Class number problem - Wikipedia

    en.wikipedia.org/wiki/Class_number_problem

    Also in 1934, Heilbronn and Edward Linfoot showed that there were at most 10 imaginary quadratic number fields with class number 1 (the 9 known ones, and at most one further). The result was ineffective (see effective results in number theory ): it did not give bounds on the size of the remaining field.

  9. Geometric primitive - Wikipedia

    en.wikipedia.org/wiki/Geometric_primitive

    Vector graphics consists of geometrical primitives.. In vector computer graphics, CAD systems, and geographic information systems, geometric primitive (or prim) is the simplest (i.e. 'atomic' or irreducible) geometric shape that the system can handle (draw, store).

  1. Related searches uvodnik matematike probleme 4 10 11 graphics 1 49 8

    april 10 2011