Calculating frames per second in a game

by

You need a smoothed average, the easiest way is to take the current answer (the time to draw the last frame) and combine it with the previous answer.

// eg.
float smoothing = 0.9; // larger=more smoothing
measurement = (measurement * smoothing) + (current * (1.0-smoothing))

By adjusting the 0.9 / 0.1 ratio you can change the ‘time constant’ – that is how quickly the number responds to changes. A larger fraction in favour of the old answer gives a slower smoother change, a large fraction in favour of the new answer gives a quicker changing value. Obviously the two factors must add to one!

More Related Contents:

  1. Big O, how do you calculate/approximate it?
  2. Circle line-segment collision detection algorithm?
  3. What distribution do you get from this broken random shuffle?
  4. Hash table runtime complexity (insert, search and delete)
  5. Generate all binary strings of length n with k bits set
  6. How to get a square root for 32 bit input in one clock cycle only?
  7. Finding whether a point lies inside a rectangle or not
  8. recursion versus iteration
  9. How do Trigonometric functions work? [closed]
  10. What algorithm gives suggestions in a spell checker?
  11. How can I measure the similarity between two images? [closed]
  12. Mapping N-dimensional value to a point on Hilbert curve
  13. Find connected components in a graph [closed]
  14. Find the paths between two given nodes?
  15. Finding all the shortest paths between two nodes in unweighted undirected graph
  16. Two Rectangles intersection
  17. Fastest primality test
  18. Efficient maths algorithm to calculate intersections
  19. How to calculate or approximate the median of a list without storing the list
  20. Sort Four Points in Clockwise Order
  21. Why use Dijkstra’s Algorithm if Breadth First Search (BFS) can do the same thing faster?
  22. Obfuscating an ID
  23. Algorithm for autocomplete?
  24. Examples of Algorithms which has O(1), O(n log n) and O(log n) complexities
  25. Is there any fast method of matrix exponentiation?
  26. An inverse Fibonacci algorithm?
  27. Design an efficient algorithm to sort 5 distinct keys in fewer than 8 comparisons
  28. Algorithm for iterating over an outward spiral on a discrete 2D grid from the origin
  29. determine if a point sits inside an arbitrary shape?
  30. Find the k largest elements in order

Leave a Comment