Method for storing and comparing computer generated lines
First Claim
Patent Images
1. A method for creating an array of quadrants using a computer, the computer comprising a processor, a memory, and either a computer mouse or a digitizer tablet, the method comprising:
- capturing a series of x, y coordinate values generated by either a computer mouse or a digitizer tablet and using consecutive points to create an quadrant array that can be stored in computer storage according to the following pseudo code;
for i = 0 to N −
where x[i] and y[i] over the range i=0 to i=N−
1
xVal = x[ i + 1 ] −
x[ i ]
yVal = y[ i + 1 ] −
y[ i ]
QARRAY[ i ] = QUAD_1
if xVal >
0 &
&
yVal >
0
then QARRAY[ i ] = QUAD_1
if xVal <
0 &
&
yVal >
0
then QARRAY[ i ] = QUAD_2
if xVal <
0 &
&
yVal <
0
then QARRAY[ i ] = QUAD_3
if xVal >
0 &
&
yVal <
0
then QARRAY[ i ] = QUAD_4
1 is the discrete representation of a line, QARRAY[i] over the range i=0 to i=N−
2 is the quadrant array, QUAD—
1, QUAD—
2, QUAD—
3, and QUAD—
4 are integers, xVal and yVal are integers, and N is the number of points.
4 Assignments
0 Petitions
Accused Products
Abstract
A method is provided for creating a quadrant array by using two consecutive points in an array of x, y coordinate values generated by movements of a computer mouse or a digitizer tablet. The quadrant array is then saved in computer storage for later verification with a sample quadrant array by using a comparison function.
-
Citations
3 Claims
-
1. A method for creating an array of quadrants using a computer, the computer comprising a processor, a memory, and either a computer mouse or a digitizer tablet, the method comprising:
-
capturing a series of x, y coordinate values generated by either a computer mouse or a digitizer tablet and using consecutive points to create an quadrant array that can be stored in computer storage according to the following pseudo code;
for i = 0 to N −
1
xVal = x[ i + 1 ] −
x[ i ]
yVal = y[ i + 1 ] −
y[ i ]
QARRAY[ i ] = QUAD_1
if xVal >
0 &
&
yVal >
0
then QARRAY[ i ] = QUAD_1
if xVal <
0 &
&
yVal >
0
then QARRAY[ i ] = QUAD_2
if xVal <
0 &
&
yVal <
0
then QARRAY[ i ] = QUAD_3
if xVal >
0 &
&
yVal <
0
then QARRAY[ i ] = QUAD_4where x[i] and y[i] over the range i=0 to i=N−
1 is the discrete representation of a line,QARRAY[i] over the range i=0 to i=N−
2 is the quadrant array,QUAD—
1, QUAD—
2, QUAD—
3, and QUAD—
4 are integers,xVal and yVal are integers, and N is the number of points.
-
-
2. A method for comparing two quadrant arrays comprising:
-
calculating the difference between the quadrant array sizes according to the following relationships;
diff=LC2*errorThreshold
LC1>
=LC2−
diff &
&
LC1<
=LC2+diffwhere errorthreshold is a decimal number from 0 to 1 inclusive, LC1 represents the smallest quadrant array size, LC2 represents the largest quadrant array size, and diff is the error difference calculated by taking LC2 multiply that by errorThreshold;
-
-
3. A method for comparing two quadrant arrays comprising:
-
calculating the number of matched quadrant elements of two quadrant arrays according to the following pseudo code;
PQM = 0 QM = 0 for k = 0 to k <
30
for i = 0 to i <
LC1 −
k
if L1 [ i ] == L2[ i + k ]
increment PQM
if i <
LC1 −
k
break
if PQM >
QM
then QM = PQM
QM = 0
If k == 30
breakwhere L1[i] and L2[i] are quadrant arrays, PQM is the previous number of quadrant matches, QM is the number of quadrant matches, LC1 is the smallest number of points, k ranges from 0 to 30 inclusive, and i ranges from 0 to i<
LC1−
k.
-
Specification