4.1 Triangles and Angles
... Parts of a triangle • Each of the three points joining the sides of a triangle is a vertex.(plural: vertices). A, B and C are vertices. • Two sides sharing a common vertext are adjacent sides. • The third is the side opposite an angle ...
... Parts of a triangle • Each of the three points joining the sides of a triangle is a vertex.(plural: vertices). A, B and C are vertices. • Two sides sharing a common vertext are adjacent sides. • The third is the side opposite an angle ...
Triangle Congruence Postulates Congruent Triangles
... two angles and a non-included side of one triangle are congruent to two angles and a non-included side of a second triangle ...
... two angles and a non-included side of one triangle are congruent to two angles and a non-included side of a second triangle ...
triangles and congruence
... GROUP 3 : 1. Annisa Luthfi FM 2. Nadiatul Khikmah 3. Rizqi Dwi Maharani 4. Rosyida Khikmawati ...
... GROUP 3 : 1. Annisa Luthfi FM 2. Nadiatul Khikmah 3. Rizqi Dwi Maharani 4. Rosyida Khikmawati ...
proving triangle similarity
... • determine whether two triangles are similar • prove or disprove triangle similarity using similarity shortcuts (AA, SSS, SAS) ...
... • determine whether two triangles are similar • prove or disprove triangle similarity using similarity shortcuts (AA, SSS, SAS) ...
1 1 S en
... A dilation is a transformation that makes a figure larger or smaller than the original figure based on a ratio given by a scale factor. When the scale factor is greater than 1, the figure is made larger. When the scale factor is between 0 and 1, the figure is made smaller. When the scale factor is 1 ...
... A dilation is a transformation that makes a figure larger or smaller than the original figure based on a ratio given by a scale factor. When the scale factor is greater than 1, the figure is made larger. When the scale factor is between 0 and 1, the figure is made smaller. When the scale factor is 1 ...
Apollonian network
In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.