Given a radius length r and an angle t in radians and a circle’s center (h,k), you can calculate the coordinates of a point on the circumference as follows (this is pseudo-code, you’ll have to adapt it to your language):
float x = r*cos(t) + h;
float y = r*sin(t) + k;
Related Contents:
- How to determine if a point is in a 2D triangle? [closed]
- Circle line-segment collision detection algorithm?
- How do I calculate a point on a circle’s circumference?
- Algorithm to detect intersection of two rectangles?
- How to calculate an angle from three points? [closed]
- Sort points in clockwise order?
- How do you calculate the average of a set of circular data? [closed]
- How do Trigonometric functions work? [closed]
- Puzzle: Find largest rectangle (maximal rectangle problem)
- Calculate largest inscribed rectangle in a rotated rectangle
- Circle-circle intersection points
- Location of highest density on a sphere
- Determining if two line segments intersect? [duplicate]
- Calculate distance between two latitude-longitude points? (Haversine formula)
- Unique (non-repeating) random numbers in O(1)?
- How to create the most compact mapping n → isprime(n) up to a limit N?
- An algorithm for inflating/deflating (offsetting, buffering) polygons
- Algorithm to find Largest prime factor of a number
- Is log(n!) = Θ(n·log(n))?
- Fast permutation -> number -> permutation mapping algorithms
- How to make rounded percentages add up to 100%
- Writing your own square root function
- How to find the intersection point between a line and a rectangle?
- Is it possible to express “t” variable from Cubic Bezier Curve equation?
- How do I efficiently determine if a polygon is convex, non-convex or complex?
- Finding whether a point lies inside a rectangle or not
- Choosing n numbers with fixed sum
- What is the fastest algorithm to calculate the minimum distance between two sets of points?
- Fast way to calculate n! mod m where m is prime?
- Why does this simple shuffle algorithm produce biased results?
- Computing set intersection in linear time?
- Fastest algorithm for circle shift N sized array for M position
- Finding out nth fibonacci number for very large ‘n’
- Need help in mod 1000000007 questions
- What is an Efficient algorithm to find Area of Overlapping Rectangles
- Algorithm for finding similar images
- Largest circle inside a non-convex polygon
- How to compare two shapes?
- Check if one integer is an integer power of another
- Two Rectangles intersection
- How to find two most distant points?
- Collision detection of huge number of circles
- Calculating the angle between two lines without having to calculate the slope? (Java)
- Combined area of overlapping circles
- finding a^b^c^… mod m
- Create non-intersecting polygon passing through all given points
- How to find the smallest number with just 0 and 1 which is divided by a given number?
- Reverse complex 2D lookup table
- How do I determine whether my calculation of pi is accurate?
- Given Prime Number N, Compute the Next Prime?