• Popular Now

• 12
• 12
• 9
• 10
• 13

Archived

This topic is now archived and is closed to further replies.

Need an algorithm for converting 0-n to 0-255

This topic is 6027 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

Recommended Posts

distance is 0-n, I need to convert the distance to 0-255. If I could I would do it like this for example: increasement=256/max_distance;
  for(x=0;x
But I can''t in this case. I need it to be somehow check with the current distance. Here''s what I''m trying to do with a circle:
  if(x
I know this is an easy question, but my brains are seriously jammed atm and I can''t figure out it by myself right now. So any help would be appritiated. thank you

Share on other sites
  double multiplier = 256/n;

now if n were say 128.....the multiplier would be 2
so any distance would be mutliplied by 2 to get the distance in terms of 0 to 255

"I pity the fool, thug, or soul who tries to take over the world, then goes home crying to his momma."
- Mr. T