A simplified version of the algorithm is below: Set i = index of closest target (T i
Fantastic news! We've Found the answer you've been seeking!
Question:
A simplified version of the algorithm is below:
- Set i = index of closest target (Ti) by intersecting distance
- Set j = index of second closest target (Tj) by intersecting distance
- Set radius of bubble cursor = min(ConDi, IntDj)
This algorithm ensures that the bubble cursor will at least intersect the closest object, and possibly completely contain it. When the bubble only intersects the closest object and does not completely contain it, we morph the cursor by extending a second bubble, which quickly expands from the intersection points and envelopes the object. This acts as a reinforcing visual cue to the user that the object is indeed captured by the cursor.
Related Book For
Microeconomics An Intuitive Approach with Calculus
ISBN: 978-0538453257
1st edition
Authors: Thomas Nechyba
Posted Date: