given two triangles

  • 81trigonometry — trigonometric /trig euh neuh me trik/, trigonometrical, adj. trigonometrically, adv. /trig euh nom i tree/, n. the branch of mathematics that deals with the relations between the sides and angles of plane or spherical triangles, and the… …

    Universalium

  • 82mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… …

    Universalium

  • 83Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… …

    Wikipedia

  • 84Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… …

    Wikipedia

  • 85Hyperbolic geometry — Lines through a given point P and asymptotic to line R. A triangle immersed in a saddle shape plane (a hyperbolic paraboloid), as well as two diverging ultraparall …

    Wikipedia

  • 86Wallpaper group — A wallpaper group (or plane symmetry group or plane crystallographic group) is a mathematical classification of a two dimensional repetitive pattern, based on the symmetries in the pattern. Such patterns occur frequently in architecture and… …

    Wikipedia

  • 87Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …

    Wikipedia

  • 88Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… …

    Wikipedia

  • 89geometry — /jee om i tree/, n. 1. the branch of mathematics that deals with the deduction of the properties, measurement, and relationships of points, lines, angles, and figures in space from their defining conditions by means of certain assumed properties… …

    Universalium

  • 90Tetrahedron — For the academic journal, see Tetrahedron (journal). Regular Tetrahedron (Click here for rotating model) Type Platonic solid Elements F = 4, E = 6 V = 4 (χ = 2) Faces by s …

    Wikipedia