Given a n-sided regular polygon and three vertices a1, a2 and a3, the task is to find the angle suspended at vertex a1 by vertex a2 and vertex a3.
Input: n = 6, a1 = 1, a2 = 2, a3 = 4 Output: 90 Input: n = 5, a1 = 1, a2 = 2, a3 = 5 Output: 36
- The angle subtended by an edge on the center of n sided regular polygon is 360/n.
- The angle subtended by vertices seperated by k edges becomes (360*k)/n.
- The chord between the vertices subtends an angle with half the value of the angle subtended at the center at the third vertex which is a point on the circumference on the circumcircle.
- Let the angle obtained in this manner be a = (180*x)/n where k is number of edges between i and k.
- Similarily for the opposite vertex we get the angle to be b = (180*y)/n where l is number of edges between j and k.
- The angle between the three vertices thus equals 180-a-b.
Below is the implementation of the above approach:
- How to check if a given point lies inside or outside a polygon?
- Calculate the angle between hour hand and minute hand
- Find other two sides of a right angle triangle
- Find if it's possible to rotate the page by an angle or not.
- Program to find the Interior and Exterior Angle of a Regular Polygon
- Check if it is possible to create a polygon with a given angle
- Angle between two Planes in 3D
- Probability that the pieces of a broken stick form a n sided polygon
- Number of ways a convex polygon of n+2 sides can split into triangles by connecting vertices
- Area of a largest square fit in a right angle triangle
- Area of a circle inscribed in a regular hexagon
- Find other two sides and angles of a right angle triangle
- Program to find the Circumcircle of any regular polygon
- Program to find the Perimeter of a Regular Polygon
- Side of a regular n-sided polygon circumscribed in a circle
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.