this post was submitted on 11 Oct 2023
15 points (94.1% liked)

Godot

6014 readers
159 users here now

Welcome to the programming.dev Godot community!

This is a place where you can discuss about anything relating to the Godot game engine. Feel free to ask questions, post tutorials, show off your godot game, etc.

Make sure to follow the Godot CoC while chatting

We have a matrix room that can be used for chatting with other members of the community here

Links

Other Communities

Rules

We have a four strike system in this community where you get warned the first time you break a rule, then given a week ban, then given a year ban, then a permanent ban. Certain actions may bypass this and go straight to permanent ban if severe enough and done with malicious intent

Wormhole

!roguelikedev@programming.dev

Credits

founded 2 years ago
MODERATORS
 

I have a min and max position of an object and I want to represent an arbitrary point between them as a float between 0.0 and 1.0. This feels relatively basic math, but I can't quite figure out what I need to do with this. Is there a special name for this sort of thing? Also, are there any built-in methods that would be useful for this?

top 9 comments
sorted by: hot top controversial new old
[–] breadsmasher@lemmy.world 10 points 1 year ago (1 children)
[–] MossBear@lemmy.world 2 points 1 year ago

I think that may work! Thanks!

[–] slinkie@lemmy.world 4 points 1 year ago* (last edited 1 year ago)

Maybe you’re looking for lerp()?

Given two vectors and a value between 1.0 and 0, it’ll produce a vector at a point between the inputs.

https://docs.godotengine.org/en/stable/classes/class_vector2.html#class-vector2-method-lerp

[–] amtwon@lemmy.world 3 points 1 year ago (1 children)

I think /u/breadsmasher has your answer, but FWIW, mapping from an arbitrary range onto the range of 0.0 to 1.0 is called normalization

Not sure if there's a name for the opposite operation

[–] amtwon@lemmy.world 3 points 1 year ago

Here's a Wikipedia article where they just call it Rescaling

https://en.m.wikipedia.org/wiki/Feature_scaling#Methods

[–] TropicalDingdong@lemmy.world 2 points 1 year ago* (last edited 1 year ago) (1 children)

Well there is normalization , regularization, and standardization, but it basically depends on what you want to do and what implications that has for your data.

X is the set and x is a value in that set.

So:

1 - { [ max(X) - x ] / [ max(X)- min(X) ] }

or alternatively,

[x- min(X)] / [max(X)-min(X)]

Should do what you are asking, which sounds like normalization. That will normalize your values between 0 and 1. However, it wont do anything about your data being skewed to one side or the other. So the mean of this value won't be 0.5, the halfway point between 0 and 1.

If you want something like that, you will need to standardize your data prior to running the above algorithm:

Something like:

[ x - mean(X) ] / std(X)

This will center your data around 0. If you then apply the first function (normalization), it should now be centered around 0.5 (even if it is not normally distributed).

[–] Toine@sh.itjust.works 2 points 1 year ago

OP might also be interested in the reverse operation. If s is your number from 0 to 1, the corresponding position in the "real" space is min + s * (max-min), which can also be written as (1-s)min + smax . This is sometimes called a linear interpolation, or a weighted average. Note that you can also use the same formulas with s smaller than zero and larger than one, thus performing linear extrapolation. Finally, these same formulas apply in higher dimensions, just think of min and max as the coordinates of two vectors, and appy these formulas for each coordinate, and you get linear interpolation between your two vectors.

[–] nathanjent@programming.dev 1 points 1 year ago
[–] o11c@programming.dev 1 points 1 year ago

Related, note that division is much slower than multiplication.

Instead of:

n / d

see if you can refactor it to:

n * (1.0/d)

where that inverse can then be hoisted out of loops.