When.com Web Search

  1. Ad

    related to: isosceles right triangle area problems

Search results

  1. Results From The WOW.Com Content Network
  2. Circle packing in an isosceles right triangle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_an...

    Solutions to the equivalent problem of maximizing the minimum distance between n points in an isosceles right triangle, were known to be optimal for n < 8 [2] and were extended up to n = 10. [3] In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n = 13. [4]

  3. Malfatti circles - Wikipedia

    en.wikipedia.org/wiki/Malfatti_circles

    Malfatti's assumption that the two problems are equivalent is incorrect. Lob and Richmond (), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the ...

  4. Isosceles triangle - Wikipedia

    en.wikipedia.org/wiki/Isosceles_triangle

    In geometry, an isosceles triangle (/ aɪ ˈ s ɒ s ə l iː z /) is a triangle that has two sides of equal length or two angles of equal measure. Sometimes it is specified as having exactly two sides of equal length, and sometimes as having at least two sides of equal length, the latter version thus including the equilateral triangle as a special case.

  5. Area of a triangle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_triangle

    In geometry, calculating the area of a triangle is an elementary problem encountered often in many different situations. The best known and simplest formula is T = b h / 2 , {\displaystyle T=bh/2,} where b is the length of the base of the triangle, and h is the height or altitude of the triangle.

  6. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    To convert between these two formulations of the problem, the square side for unit circles will be = + /. The optimal packing of 15 circles in a square Optimal solutions have been proven for n ≤ 30. Packing circles in a rectangle; Packing circles in an isosceles right triangle - good estimates are known for n < 300.

  7. Bernoulli quadrisection problem - Wikipedia

    en.wikipedia.org/.../Bernoulli_quadrisection_problem

    The triangle shown is the unique isosceles triangle for which there are exactly two perpendicular quadrisections. [ 1 ] In triangle geometry , the Bernoulli quadrisection problem asks how to divide a given triangle into four equal-area pieces by two perpendicular lines.

  8. AOL Mail

    mail.aol.com

    Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!

  9. Special right triangle - Wikipedia

    en.wikipedia.org/wiki/Special_right_triangle

    Set square shaped as 45° - 45° - 90° triangle The side lengths of a 45° - 45° - 90° triangle 45° - 45° - 90° right triangle of hypotenuse length 1.. In plane geometry, dividing a square along its diagonal results in two isosceles right triangles, each with one right angle (90°, ⁠ π / 2 ⁠ radians) and two other congruent angles each measuring half of a right angle (45°, or ...