Rational for the proposed snapon logic

[ Q2 03 - Q4 05 Archive ] [ Current Message Board ] [ Archives ] [ Search ]

In Reply to: Cursor snapon logic suggestion posted by Kamtsa on March 10, 2005 at 20:01:09:

Here is the rational for the proposed algorithm.

Since the data points are not visible, if one wants to examine a specific graph, all she can do it bring the cursor close to that graph. This is why we need step a.

As for step b, first it matches the distance as percived by the user on screen and second, it always select a data point from the selected point, even if the closest data point is not that close to the graph. Again, this is required because the user don't know where the data points are and therefore cannot position the cursor close to one of them.

The real proof will be of course by implementing it and see how it feels ;-)

Thanks

Kamtsa

Replies:

• Re: Rational for the proposed snapon logic Mark 22:40:10 03/10/05 (0)