Reflection and Rotation Symmetry - WORKSHEET #8 – Geometrycommoncore NAME: ______1

Total Page：16

File Type：pdf, Size：1020Kb

Reflection and Rotation Symmetry - WORKSHEET #8 – geometrycommoncore NAME: __________________________ 1 1. Draw in the lines of symmetry for each of the shapes. If none, leave the diagram blank. a) b) c) d) e) f) g) h) (Parallelogram) (Regular Hexagon) 2. Use the diagrams from question #1 to determine the order and angle of rotation symmetry for the following shapes. If none, write none. a) Order = ____________ b) Order = ____________ c) Order = ____________ d) Order = ____________ Angle = _____________ Angle = _____________ Angle = _____________ Angle = _____________ e) Order = ____________ f) Order = ____________ g) Order = ____________ h) Order = ____________ Angle = _____________ Angle = _____________ Angle = _____________ Angle = _____________ I) Which of the shapes have point symmetry? ______________________ What do you notice about their orders? _________________________________________________________ 3. Draw a figure that meets the given symmetry requirements. It must have: a) line symmetry, but not b) rotational symmetry, but not c) exactly 3 lines of symmetry. rotational symmetry. line symmetry. 4. a) Draw three different figures, each having exactly one line of symmetry. b) Do you notice any similarities in these three shapes? Reflection and Rotation Symmetry - WORKSHEET #8 – geometrycommoncore 2 5. Given the shape, shade it so that it has reflectional symmetry. a) One line of symmetry b) One line of symmetry c) Two lines of symmetry d) Two lines of symmetry 6. Given the shape, shade it so that it has rotational symmetry. a) Order 2 b) Order 2 c) Order 4 d) Order 4 7. Each figure shows part of a shape with a center of rotation and a given rotational symmetry. Complete the figure. a) Order 4 b) Order 3 c) Order 8 8. What is the relationship between the order of the shape and the angle of rotation? 9. Here are the letters of the alphabet. Classify them into the given categories. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z One Line of Symmetry Two Lines of Symmetry Rotational Symmetry Point Symmetry No Symmetry Reflection and Rotation Symmetry - WORKSHEET #8 – geometrycommoncore 3 .

Copy Link

Recommended publications

In Order for the Figure to Map Onto Itself, the Line of Reflection Must Go Through the Center Point
3-5 Symmetry State whether the figure appears to have line symmetry. Write yes or no. If so, copy the figure, draw all lines of symmetry, and state their number. 1. SOLUTION: A figure has reflectional symmetry if the figure can be mapped onto itself by a reflection in a line. The figure has reflectional symmetry. In order for the figure to map onto itself, the line of reflection must go through the center point. Two lines of reflection go through the sides of the figure. Two lines of reflection go through the vertices of the figure. Thus, there are four possible lines that go through the center and are lines of reflections. Therefore, the figure has four lines of symmetry. eSolutionsANSWER: Manual - Powered by Cognero Page 1 yes; 4 2. SOLUTION: A figure has reflectional symmetry if the figure can be mapped onto itself by a reflection in a line. The given figure does not have reflectional symmetry. There is no way to fold or reflect it onto itself. ANSWER: no 3. SOLUTION: A figure has reflectional symmetry if the figure can be mapped onto itself by a reflection in a line. The given figure has reflectional symmetry. The figure has a vertical line of symmetry. It does not have a horizontal line of symmetry. The figure does not have a line of symmetry through the vertices. Thus, the figure has only one line of symmetry. ANSWER: yes; 1 State whether the figure has rotational symmetry. Write yes or no. If so, copy the figure, locate the center of symmetry, and state the order and magnitude of symmetry.
[Show full text]
Enhancing Self-Reflection and Mathematics Achievement of At-Risk Urban Technical College Students
Psychological Test and Assessment Modeling, Volume 53, 2011 (1), 108-127 Enhancing self-reflection and mathematics achievement of at-risk urban technical college students Barry J. Zimmerman1, Adam Moylan2, John Hudesman3, Niesha White3, & Bert Flugman3 Abstract A classroom-based intervention study sought to help struggling learners respond to their academic grades in math as sources of self-regulated learning (SRL) rather than as indices of personal limita- tion. Technical college students (N = 496) in developmental (remedial) math or introductory col- lege-level math courses were randomly assigned to receive SRL instruction or conventional in- struction (control) in their respective courses. SRL instruction was hypothesized to improve stu- dents’ math achievement by showing them how to self-reflect (i.e., self-assess and adapt to aca- demic quiz outcomes) more effectively. The results indicated that students receiving self-reflection training outperformed students in the control group on instructor-developed examinations and were better calibrated in their task-specific self-efficacy beliefs before solving problems and in their self- evaluative judgments after solving problems. Self-reflection training also increased students’ pass- rate on a national gateway examination in mathematics by 25% in comparison to that of control students. Key words: self-regulation, self-reflection, math instruction 1 Correspondence concerning this article should be addressed to: Barry Zimmerman, PhD, Graduate Center of the City University of New York and Center for Advanced Study in Education, 365 Fifth Ave- nue, New York, NY 10016, USA; email: [email protected] 2 Now affiliated with the University of California, San Francisco, School of Medicine 3 Graduate Center of the City University of New York and Center for Advanced Study in Education Enhancing self-reflection and math achievement 109 Across America, faculty and policy makers at two-year and technical colleges have been deeply troubled by the low academic achievement and high attrition rate of at-risk stu- dents.
[Show full text]
Reflection Invariant and Symmetry Detection
1 Reflection Invariant and Symmetry Detection Erbo Li and Hua Li Abstract—Symmetry detection and discrimination are of fundamental meaning in science, technology, and engineering. This paper introduces reflection invariants and defines the directional moments(DMs) to detect symmetry for shape analysis and object recognition. And it demonstrates that detection of reflection symmetry can be done in a simple way by solving a trigonometric system derived from the DMs, and discrimination of reflection symmetry can be achieved by application of the reflection invariants in 2D and 3D. Rotation symmetry can also be determined based on that. Also, if none of reflection invariants is equal to zero, then there is no symmetry. And the experiments in 2D and 3D show that all the reflection lines or planes can be deterministically found using DMs up to order six. This result can be used to simplify the efforts of symmetry detection in research areas,such as protein structure, model retrieval, reverse engineering, and machine vision etc. Index Terms—symmetry detection, shape analysis, object recognition, directional moment, moment invariant, isometry, congruent, reflection, chirality, rotation F 1 INTRODUCTION Kazhdan et al. [1] developed a continuous measure and dis- The essence of geometric symmetry is self-evident, which cussed the properties of the reflective symmetry descriptor, can be found everywhere in nature and social lives, as which was expanded to 3D by [2] and was augmented in shown in Figure 1. It is true that we are living in a spatial distribution of the objects asymmetry by [3] . For symmetric world. Pursuing the explanation of symmetry symmetry discrimination [4] defined a symmetry distance will provide better understanding to the surrounding world of shapes.
[Show full text]
The Cubic Groups
The Cubic Groups Baccalaureate Thesis in Electrical Engineering Author: Supervisor: Sana Zunic Dr. Wolfgang Herfort 0627758 Vienna University of Technology May 13, 2010 Contents 1 Concepts from Algebra 4 1.1 Groups . 4 1.2 Subgroups . 4 1.3 Actions . 5 2 Concepts from Crystallography 6 2.1 Space Groups and their Classification . 6 2.2 Motions in R3 ............................. 8 2.3 Cubic Lattices . 9 2.4 Space Groups with a Cubic Lattice . 10 3 The Octahedral Symmetry Groups 11 3.1 The Elements of O and Oh ..................... 11 3.2 A Presentation of Oh ......................... 14 3.3 The Subgroups of Oh ......................... 14 2 Abstract After introducing basics from (mathematical) crystallography we turn to the description of the octahedral symmetry groups { the symmetry group(s) of a cube. Preface The intention of this account is to provide a description of the octahedral sym- metry groups { symmetry group(s) of the cube. We first give the basic idea (without proofs) of mathematical crystallography, namely that the 219 space groups correspond to the 7 crystal systems. After this we come to describing cubic lattices { such ones that are built from \cubic cells". Finally, among the cubic lattices, we discuss briefly the ones on which O and Oh act. After this we provide lists of the elements and the subgroups of Oh. A presentation of Oh in terms of generators and relations { using the Dynkin diagram B3 is also given. It is our hope that this account is accessible to both { the mathematician and the engineer. The picture on the title page reflects Haüy'sidea of crystal structure [4].
[Show full text]
Isometries and the Plane
Chapter 1 Isometries of the Plane \For geometry, you know, is the gate of science, and the gate is so low and small that one can only enter it as a little child. (W. K. Cliﬀord) The focus of this ﬁrst chapter is the 2-dimensional real plane R2, in which a point P can be described by its coordinates: 2 P 2 R ;P = (x; y); x 2 R; y 2 R: Alternatively, we can describe P as a complex number by writing P = (x; y) = x + iy 2 C: 2 The plane R comes with a usual distance. If P1 = (x1; y1);P2 = (x2; y2) 2 R2 are two points in the plane, then p 2 2 d(P1;P2) = (x2 − x1) + (y2 − y1) : Note that this is consistent withp the complex notation. For P = x + iy 2 C, p 2 2 recall that jP j = x + y = P P , thus for two complex points P1 = x1 + iy1;P2 = x2 + iy2 2 C, we have q d(P1;P2) = jP2 − P1j = (P2 − P1)(P2 − P1) p 2 2 = j(x2 − x1) + i(y2 − y1)j = (x2 − x1) + (y2 − y1) ; where ( ) denotes the complex conjugation, i.e. x + iy = x − iy. We are now interested in planar transformations (that is, maps from R2 to R2) that preserve distances. 1 2 CHAPTER 1. ISOMETRIES OF THE PLANE Points in the Plane • A point P in the plane is a pair of real numbers P=(x,y). d(0,P)2 = x2+y2. • A point P=(x,y) in the plane can be seen as a complex number x+iy.
[Show full text]
Chapter 1 – Symmetry of Molecules – P. 1
Chapter 1 – Symmetry of Molecules – p. 1 - 1. Symmetry of Molecules 1.1 Symmetry Elements · Symmetry operation: Operation that transforms a molecule to an equivalent position and orientation, i.e. after the operation every point of the molecule is coincident with an equivalent point. · Symmetry element: Geometrical entity (line, plane or point) which respect to which one or more symmetry operations can be carried out. In molecules there are only four types of symmetry elements or operations: · Mirror planes: reflection with respect to plane; notation: s · Center of inversion: inversion of all atom positions with respect to inversion center, notation i · Proper axis: Rotation by 2p/n with respect to the axis, notation Cn · Improper axis: Rotation by 2p/n with respect to the axis, followed by reflection with respect to plane, perpendicular to axis, notation Sn Formally, this classification can be further simplified by expressing the inversion i as an improper rotation S2 and the reflection s as an improper rotation S1. Thus, the only symmetry elements in molecules are Cn and Sn. Important: Successive execution of two symmetry operation corresponds to another symmetry operation of the molecule. In order to make this statement a general rule, we require one more symmetry operation, the identity E. (1.1: Symmetry elements in CH4, successive execution of symmetry operations) 1.2. Systematic classification by symmetry groups According to their inherent symmetry elements, molecules can be classified systematically in so called symmetry groups. We use the so-called Schönfliess notation to name the groups, Chapter 1 – Symmetry of Molecules – p. 2 - which is the usual notation for molecules.
[Show full text]
Pose Estimation for Objects with Rotational Symmetry
Pose Estimation for Objects with Rotational Symmetry Enric Corona, Kaustav Kundu, Sanja Fidler Abstract— Pose estimation is a widely explored problem, enabling many robotic tasks such as grasping and manipulation. In this paper, we tackle the problem of pose estimation for objects that exhibit rotational symmetry, which are common in man-made and industrial environments. In particular, our aim is to infer poses for objects not seen at training time, but for which their 3D CAD models are available at test time. Previous X 2 X 1 X 2 X 1 work has tackled this problem by learning to compare captured Y ∼ 2 Y ∼ 2 Y ∼ 2 Y ∼ 2 views of real objects with the rendered views of their 3D CAD Z ∼ 6 Z ∼ 1 Z ∼ Z ∼ 1 ∼ ∼ ∼ ∞ ∼ models, by embedding them in a joint latent space using neural Fig. 1. Many industrial objects such as various tools exhibit rotational networks. We show that sidestepping the issue of symmetry symmetries. In our work, we address pose estimation for such objects. in this scenario during training leads to poor performance at test time. We propose a model that reasons about rotational symmetry during training by having access to only a small set of that this is not a trivial task, as the rendered views may look symmetry-labeled objects, whereby exploiting a large collection very different from objects in real images, both because of of unlabeled CAD models. We demonstrate that our approach different background, lighting, and possible occlusion that signiﬁcantly outperforms a naively trained neural network on arise in real scenes.
[Show full text]
12-5 Worksheet Part C
Name ________________________________________ Date __________________ Class__________________ LESSON Reteach 12-5 Symmetry A figure has symmetry if there is a transformation of the figure such that the image and preimage are identical. There are two kinds of symmetry. The figure has a line of symmetry that divides the figure into two congruent halves. Line Symmetry one line of symmetry two lines of symmetry no line symmetry When a figure is rotated between 0° and 360°, the resulting figure coincides with the original. • The smallest angle through which the figure is rotated to coincide with itself is called the angle of rotational symmetry. • The number of times that you can get an identical figure when repeating the degree of rotation is called the order of the rotational Rotational symmetry. Symmetry angle: 180° 120° no rotational order: 2 3 symmetry Tell whether each figure has line symmetry. If so, draw all lines of symmetry. 1. 2. _________________________________________ ________________________________________ Tell whether each figure has rotational symmetry. If so, give the angle of rotational symmetry and the order of the symmetry. 3. 4. _________________________________________ ________________________________________ Original content Copyright © by Holt McDougal. Additions and changes to the original content are the responsibility of the instructor. 12-38 Holt Geometry Name ________________________________________ Date __________________ Class__________________ LESSON Reteach 12-5 Symmetry continued Three-dimensional figures can also have symmetry. Symmetry in Three Description Example Dimensions A plane can divide a figure into two Plane Symmetry congruent halves. There is a line about which a figure Symmetry About can be rotated so that the image and an Axis preimage are identical.
[Show full text]
Lesson 4: Definition of Reflection and Basic Properties
NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 4 8•2 Lesson 4: Definition of Reflection and Basic Properties Student Outcomes . Students know the definition of reflection and perform reflections across a line using a transparency. Students show that reflections share some of the same fundamental properties with translations (e.g., lines map to lines, angle- and distance-preserving motion). Students know that reflections map parallel lines to parallel lines. Students know that for the reflection across a line 퐿 and for every point 푃 not on 퐿, 퐿 is the bisector of the segment joining 푃 to its reflected image 푃′. Classwork Example 1 (5 minutes) The reflection across a line 퐿 is defined by using the following example. MP.6 . Let 퐿 be a vertical line, and let 푃 and 퐴 be two points not on 퐿, as shown below. Also, let 푄 be a point on 퐿. (The black rectangle indicates the border of the paper.) . The following is a description of how the reflection moves the points 푃, 푄, and 퐴 by making use of the transparency. Trace the line 퐿 and three points onto the transparency exactly, using red. (Be sure to use a transparency that is the same size as the paper.) . Keeping the paper fixed, flip the transparency across the vertical line (interchanging left and right) while keeping the vertical line and point 푄 on top of their black images. The position of the red figures on the transparency now represents the Scaffolding: reflection of the original figure. 푅푒푓푙푒푐푡푖표푛(푃) is the point represented by the There are manipulatives, such red dot to the left of 퐿, 푅푒푓푙푒푐푡푖표푛(퐴) is the red dot to the right of 퐿, and point as MIRA and Georeflector, 푅푒푓푙푒푐푡푖표푛(푄) is point 푄 itself.
[Show full text]
2-D Drawing Geometry Homogeneous Coordinates
2-D Drawing Geometry Homogeneous Coordinates The rotation of a point, straight line or an entire image on the screen, about a point other than origin, is achieved by first moving the image until the point of rotation occupies the origin, then performing rotation, then finally moving the image to its original position. The moving of an image from one place to another in a straight line is called a translation. A translation may be done by adding or subtracting to each point, the amount, by which picture is required to be shifted. Translation of point by the change of coordinate cannot be combined with other transformation by using simple matrix application. Such a combination is essential if we wish to rotate an image about a point other than origin by translation, rotation again translation. To combine these three transformations into a single transformation, homogeneous coordinates are used. In homogeneous coordinate system, two-dimensional coordinate positions (x, y) are represented by triple- coordinates. Homogeneous coordinates are generally used in design and construction applications. Here we perform translations, rotations, scaling to fit the picture into proper position 2D Transformation in Computer Graphics- In Computer graphics, Transformation is a process of modifying and re- positioning the existing graphics. • 2D Transformations take place in a two dimensional plane. • Transformations are helpful in changing the position, size, orientation, shape etc of the object. Transformation Techniques- In computer graphics, various transformation techniques are- 1. Translation 2. Rotation 3. Scaling 4. Reflection 2D Translation in Computer Graphics- In Computer graphics, 2D Translation is a process of moving an object from one position to another in a two dimensional plane.
[Show full text]
Symmetry and Groups, and Crystal Structures
CHAPTER 3: SYMMETRY AND GROUPS, AND CRYSTAL STRUCTURES Sarah Lambart RECAP CHAP. 2 2 different types of close packing: hcp: tetrahedral interstice (ABABA) ccp: octahedral interstice (ABCABC) Definitions: The coordination number or CN is the number of closest neighbors of opposite charge around an ion. It can range from 2 to 12 in ionic structures. These structures are called coordination polyhedron. RECAP CHAP. 2 Rx/Rz C.N. Type Hexagonal or An ideal close-packing of sphere 1.0 12 Cubic for a given CN, can only be Closest Packing achieved for a specific ratio of 1.0 - 0.732 8 Cubic ionic radii between the anions and 0.732 - 0.414 6 Octahedral Tetrahedral (ex.: the cations. 0.414 - 0.225 4 4- SiO4 ) 0.225 - 0.155 3 Triangular <0.155 2 Linear RECAP CHAP. 2 Pauling’s rule: #1: the coodination polyhedron is defined by the ratio Rcation/Ranion #2: The Electrostatic Valency (e.v.) Principle: ev = Z/CN #3: Shared edges and faces of coordination polyhedra decreases the stability of the crystal. #4: In crystal with different cations, those of high valency and small CN tend not to share polyhedral elements #5: The principle of parsimony: The number of different sites in a crystal tends to be small. CONTENT CHAP. 3 (2-3 LECTURES) Definitions: unit cell and lattice 7 Crystal systems 14 Bravais lattices Element of symmetry CRYSTAL LATTICE IN TWO DIMENSIONS A crystal consists of atoms, molecules, or ions in a pattern that repeats in three dimensions. The geometry of the repeating pattern of a crystal can be described in terms of a crystal lattice, constructed by connecting equivalent points throughout the crystal.
[Show full text]
In This Handout, We Discuss Orthogonal Maps and Their Significance from A
In this handout, we discuss orthogonal maps and their significance from a geometric standpoint. Preliminary results on the transpose The definition of an orthogonal matrix involves transpose, so we prove some facts about it first. Proposition 1. (a) If A is an ` × m matrix and B is an m × n matrix, then (AB)> = B>A>: (b) If A is an invertible n × n matrix, then A> is invertible and (A>)−1 = (A−1)>: Proof. (a) We compute the (i; j)-entries of both sides for 1 ≤ i ≤ n and 1 ≤ j ≤ `: m m m > X X > > X > > > > [(AB) ]ij = [AB]ji = AjkBki = [A ]kj[B ]ik = [B ]ik[A ]kj = [B A ]ij: k=1 k=1 k=1 (b) It suffices to show that A>(A−1)> = I. By (a), A>(A−1)> = (A−1A)> = I> = I: Orthogonal matrices Definition (Orthogonal matrix). An n × n matrix A is orthogonal if A−1 = A>. We will first show that \being orthogonal" is preserved by various matrix operations. Proposition 2. (a) If A is orthogonal, then so is A−1 = A>. (b) If A and B are orthogonal n × n matrices, then so is AB. Proof. (a) We have (A−1)> = (A>)> = A = (A−1)−1, so A−1 is orthogonal. (b) We have (AB)−1 = B−1A−1 = B>A> = (AB)>, so AB is orthogonal. The collection O(n) of n × n orthogonal matrices is the orthogonal group in dimension n. The above definition is often not how we identify orthogonal matrices, as it requires us to compute an n × n inverse.
[Show full text]