Browse Prior Art Database

Graphical Selection for Infix Command Syntax

IP.com Disclosure Number: IPCOM000181992D
Original Publication Date: 2009-Apr-21
Included in the Prior Art Database: 2009-Apr-21
Document File: 1 page(s) / 30K

Publishing Venue

IBM

Abstract

The following article is a discussion of a software algorithm by which a user can choose, by gesturing, an object from among a set of multiple possible objects as a target for an infix command. This idea consists of the graphical algorithm used to allow a user to select one from a number of objects by moving the pointing device in any haphazardly-traced, sort-of-circular path.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 80% of the total text.

Page 1 of 1

Graphical Selection for Infix Command Syntax

Graphical Selection for Infix Command SyntaxGraphical Selection for Infix Command Syntax

An algorithm for allowing a user to choose by gesturing

possible objects is described below.

As an example, suppose we have a graphical programming language with functions

represented by icons and data paths represented by directed lines connecting the icons. User selects one icon, the source, and issues a menu action "Make Parallel"

                                            . However, not all icons on the screen may be valid targets of the action . On button-down the system computes all possible targets and designates one of them as current target .

which will create a parallel processing connection to some other icon

user gestures with the pointing device, tracing a wobbly path round the screen the system designates each of the other possible targets in turn until on button -up the system uses the currently designated target.

The algorithm


Suppose there are N objects from which to choose .

                                                 , consider a circle of arbitrary radius with fixed center C in the middle of the screen . Divide the circle into N pie-slices, each with angular width 360/N degrees, each slice representing one of the possible N choices. Now for any arbitrary mouse or pointer position P (except P = C, of course) the line segment from C to P will pass through exactly one of the pie-slices.

As a first approximation

                                       -slices. Whenever the system receives pointer coo...