Common interface for ink trees

• US 20060188162A1
• Filed: 10/31/2002
• Published: 08/24/2006
• Est. Priority Date: 10/31/2002
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Quinton, Mary Michelle, Szilagyi, Zoltan C., Rhoten, Matthew Paul, Tolmer, Justin Garrett
• Application Number:
  US10/284,418
• Publication Number:
  US 20060188162A1
• Time in Patent Office: Days
• US Class Current: 382/226
• CPC Class Codes: G06F 40/171 by use of digital ink
• CPC Class Codes: G06F 8/70 Software maintenance or management
• CPC Class Codes: G06F 9/4862 the task being a mobile agent, i.e. specifically designed to migrate
• CPC Class Codes: G06V 10/426 Graphical representations
• CPC Class Codes: G06V 30/347 Sampling; Contour coding; Stroke extraction

Abstract

A system, method, and data structure are described that permit a function to be operable at a designated node or sub nodes. An instruction that designates one or more nodes is processed to perform the instruction on each of the nodes. If the instruction is not performable on a current node, the data structure relating to the current node is navigated to obtain one or more sub nodes. The instruction is then performed on the sub nodes.

Claims

1. A process for performing an operation on a nodal data structure comprising the following steps:

receiving an instruction;

receiving a designation of at least one node in said data structure; and

,

performing the instruction on the at least one node or nodes beneath the at least one node by navigating said data structure starting from said at least one node to find at least one sub node where said instruction may be properly performed.

2. The process according to claim 1, further comprising the step of:

when more than one node has been designated, processing said instruction independently for each designated node.

3. The process according to claim 1, wherein said nodal data structure is a tree data structure.

4. The process according to claim 1, wherein said nodal data structure is a tree data structure and includes ink information.

5. The process according to claim 1, further comprising the step of:

returning an error if there are no lower nodes.

6. The process according to claim 1, further comprising the step of:

performing said instruction on said at least one sub node.

7. The process according to claim 6, further comprising the steps of:

determining if said performance of said instruction was successful; and

,

returning an indication of the success of said performance of said instruction, otherwise returning an indication of the failure of said performance of said instruction.

8. A computer readable medium having a data structure stored thereon, said data structure comprising:

at least one word node, said word node associated with stroke information;

at least one line node, said at least one line node having at least one pointer to said at least one word node; and

at least one paragraph node, said at least one paragraph node having at least one pointer to said at least one line node, wherein said data structure may be recursively navigated during the performance of a received instruction.

9. The computer readable medium according to claim 8, further comprising sentence structure information.

10. A computer readable medium having a data structure stored thereon, said data structure comprising:

at least one word node, said word node associated with stroke information;

at least one sentence node, said at least one sentence node having at least one pointer to said at least one word node; and

at least one paragraph node, said at least one paragraph node having at least one pointer to said at least one sentence node, wherein said data structure may be recursively navigated during the performance of a received instruction.

11. The computer readable medium according to claim 10, further comprising at least one line node.

12. A system for performing an operation on a data structure comprising:

an input for receiving an instruction and a designation of at least one node of said data structure; and

a processor that determines if said instruction is performable at said at least one node and attempts to navigate to at least another node if said instruction is not performable at said at least one node.