Mouse cursor speed

[KonyJony]

Hi,

I have a slight problem with calculating cursor speed. I get my X and Y coordinates with a event and I´m using shift register to build array of those coordinates. How do I calculate distance that cursor traveled and also how can I calculate cursor speed. I´m using trigonometry to calculate distance between two points and I´m getting some nonsence numbers.  

Thanks for any solution.

[GerdW]

Hi Jony,

when your calculation gives nonsense numbers then most probably your calculation is wrong (implemented)...

Maybe you should attach your VI?!

[KonyJony]

Sorry, here is the VI. Speed is not calculated since I dont have correct distance.

[prettypwnie]

Use the probe tool to look at the arrays on your shift registers. After the first five elements get filled up, more and more get added, but those first five stay the same. So you are always comparing the current mouse position to the same number every time.

If you want to compare the current mouse position to the mouse position 5 iterations ago, you could try using an array that you keep at a fixed size of 5, or else you could also try pulling the shift register down 5 times, up to you.

[pjroland1121]

 

In regards to prettypwnie's mention of the shift register, here is a crude example you can work from.

[GerdW]

To get a more (easily) scalable version of this "shift register dragged to 5 outputs" you should have a look at the Pt-By-Pt-DataQueue: this also gives you the sample from 5 iterations ago, if configured correctly, while allowing easy changes to create shorter/longer queues…

[Yamaeda · Accepted solution]

Combining Gerds suggestion an Altenbach favorite, i think i had an Altenbach moment. 🙂

[KonyJony]

Thanks, for reply !

Just one last question, what are those block that look like a queue, or better could you post the VI ? Thanks a lot !

[GerdW]

Hi Kony,

---

@KonyJony wrote:

Just one last question, what are those block that look like a queue,

---

Did you read my messages? It's explained in the text…

[Yamaeda]

I think my example can be optimized (i haven't tried this) by reducing the queue to 9, then the Pushed out value (not used currently) should be the 10th and you don't need the Delete from array to get the last one.