Navigation of hierarchical data using climb/dive and spin inputs
AssigneeMicrosoft Corporation
InventorDonald Brinkman
Life of this patent
Estimating the term…
Abstract
A navigation mechanism for hierarchical data uses a climb/dive and rotate inputs to traverse a hierarchical dataset. The hierarchical dataset may be arranged in a filial-heir arrangement for easy traversal. The navigation mechanism may be used with several different ways of displaying the data, some of which may display both overall context and detailed view of the data. One such example may have a context section and a detail section, where the context section may present the overall context of a focus node in relation to the overall dataset and the detail section may display other nodes that are at the same or lower level than the focus node.
Claims20
A method comprising:
- receiving a hierarchical dataset;
- selecting a first focus node as a current focus node;
- selecting a first child node as a current child node;
- navigating said hierarchical dataset using a navigation mechanism configured to automatically traverse a binary tree structure of a binary tree representation of the hierarchical dataset, by:
- receiving a climb/dive input from a user and automatically navigating to a first node having a parent/child relationship to said current focus node, said first node being made a second focus node and setting said second focus node as said current focus node;
- receiving a spin input from a user and automatically navigating to a third node having a sibling node relationship to said current child node, and setting said third node as said current child node, the spin input instructing the navigation mechanism to automatically navigate across sibling nodes that are child nodes of said current focus node, the automatic navigation based on the binary tree structure, the sibling nodes having single edge connections between adjacent pairs of sibling nodes, for the automatic traversal of the binary tree structure;
- and
- rendering said hierarchical dataset with said current focus node and said current child node, including presenting a context portion of said hierarchical dataset, said context portion representing at least a portion of a zipper tree.
A system comprising:
- a renderer configured to be executed by a computer processor, said renderer that:
- receives a hierarchical dataset;
- and
- renders said hierarchical dataset with a first focus node as a current focus node and a first child node as a current child node;
- a navigation mechanism, configured to automatically traverse a binary tree structure of a binary tree representation of the hierarchical dataset, that:
- receives input from a user input device, said input comprising an climb/dive input and a spin input;
- after receiving a climb/dive input, said navigation mechanism automatically navigates to a second node having a parent/child relationship to said current focus node and sets said second node as said current focus node;
- after receiving a spin input, said navigation mechanism automatically navigates to a third node having a sibling relationship to said current child node and sets said third node as said current child node, the spin input instructing the navigation mechanism to automatically navigate across sibling nodes that are child nodes of said current focus node, the automatic navigation based on the binary tree structure, the sibling nodes having single edge connections between adjacent pairs of sibling nodes, for the automatic traversal of the binary tree structure;
- after receiving said input and changing said current focus node, causes said renderer to render said hierarchical dataset with said current focus node, including presenting a context portion of said hierarchical dataset, said context portion based on at least a portion of a zipper tree.
A method comprising:
- receiving a hierarchical dataset, said hierarchical dataset being a binary tree;
- selecting a first focus node as a current focus node;
- selecting a first child node as a current child node, said first child node being a child of said first focus node;
- rendering said hierarchical dataset using said first focus node as said current focus node and said first child node as said current child node;
- navigating said hierarchical dataset using a navigation mechanism configured to automatically traverse the binary tree structure, by:
- receiving a climb/dive input from a user and automatically navigating to a first node having a parent/child relationship to said current focus node, said first node being made a second focus node and setting said second focus node as said current focus node;
- receiving a spin input from a user and automatically navigating to a third node having a sibling node relationship to said current child node, and setting said third node as said current child node, the spin input instructing the navigation mechanism to automatically navigate across sibling nodes that are child nodes of said current focus node, the automatic navigation based on the binary tree structure, the sibling nodes having single edge connections between adjacent pairs of sibling nodes, for the automatic traversal of the binary tree structure;
- and
- rendering said hierarchical dataset with said current focus node and said current child node, including presenting a representation of at least a portion of a zipper tree.
Dependencies are inferred from the claim text.