Reflection of a point at 180 degree rotation of another point - GeeksforGeeks

26 Feb, 2021
Given two points coordinates (x1, y1) and (x2, y2)on 2D plane. The task is to find the reflection of (x1, y1) at 180 degree rotation of (x2, y2).Examples:  
Input : x1 = 0, y1 = 0, x2 = 1, y2 = 1
Output : (2, 2)
Input : x1 = 1, y1 = 1, x2 = 2, y2 = 2
Output : (3, 3)
Let the reflection point of point (x1, y1) about (x2, y2) be (x’, y’). For (x’, y’) be the 180 degree rotation of point (x1, y1) around point (x2, y2), they all must be collinear i.e all the three point must lie on a same straight line. Also, observe (x2, y2) will became mid point between (x1, y1) and (x’, y’).  
So, x’ – x2 = x2 – x1 y’ – y2 = y2 – y1x’ = 2 * x2 – x1 y’ = 2 * y2 – y1Below is the implementation of this approach:  
C++
Java
Python3
C#
PHP
Javascript
// CPP Program tof find the 180 degree reflection// of one point around another point.#include <bits/stdc++.h>using namespace std; void findPoint(int x1, int y1, int x2, int y2){    cout << "(" << 2 * x2 - x1 << ", "         << 2 * y2 - y1 << ")";}  int main(){    int x1 = 0, y1 = 0, x2 = 1, y2 = 1;    findPoint(x1, y1, x2, y2);    return 0;}
// Java Program to find the 180 degree// reflection of one point around// another point.class GFG {         static void findPoint(int x1, int y1,                          int x2, int y2)    {        System.out.println("(" + (int)(2 * x2 - x1)               + "," + (int)(2 * y2 - y1 ) + " )");    }         // Driver code    public static void main(String args[])    {        int x1 = 0, y1 = 0, x2 = 1, y2 = 1;                 findPoint(x1, y1, x2, y2);    }} // This code is contributed by Arnab Kundu.
# Python3 Program for find the 180# degree reflection of one point# around another point. def findPoint(x1, y1, x2, y2):    print("(" , 2 * x2 - x1 , ",",                2 * y2 - y1 ,")"); # Driver Codex1 = 0;y1 = 0;x2 = 1;y2 = 1;findPoint(x1, y1, x2, y2); # This code is contributed by mits
// C# Program to find the 180 degree reflection// of one point around another point.using System; public class GFG {         static void findPoint(int x1, int y1,                          int x2, int y2)    {        Console.WriteLine("(" + (int)(2 * x2 - x1)               + "," + (int)(2 * y2 - y1 ) + " )");    }         // Driver code    static public void Main(String []args)    {        int x1 = 0, y1 = 0, x2 = 1, y2 = 1;                 findPoint(x1, y1, x2, y2);    }} // This code is contributed by Arnab Kundu.
<?php// PHP Program for find the 180// degree reflection of one point// around another point. function findPoint($x1, $y1, $x2, $y2){    echo "(" , 2 * $x2 - $x1 , ", "                , 2 * $y2 - $y1 ,")";}     // Driver Code    $x1 = 0;    $y1 = 0;    $x2 = 1;    $y2 = 1;    findPoint($x1, $y1, $x2, $y2); // This code is contributed by anuj_67?>
<script> // Javascript Program to find the 180 degree reflection// of one point around another point. function findPoint(x1, y1, x2, y2){    document.write("(" + 2 * (x2 - x1) + ", "        + 2 * (y2 - y1) + ")");}     let x1 = 0, y1 = 0, x2 = 1, y2 = 1;    findPoint(x1, y1, x2, y2);  // This code is contributed by Mayank Tyagi </script>
(2, 2)
 
Time Complexity : O(1) 
andrew1234
vt_m
Mithun Kumar
mayanktyagi1709
Geometric
Mathematical
School Programming
Mathematical
Geometric
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Comments
Old Comments
Equation of circle when three points on the circle are given
Circle and Lattice Points
Convex Hull using Divide and Conquer Algorithm
Line Clipping | Set 2 (Cyrus Beck Algorithm)
Minimum Cost Polygon Triangulation
Program for Fibonacci numbers
C++ Data Types
Write a program to print all permutations of a given string
Set in C++ Standard Template Library (STL)
Coin Change | DP-7