发明名称 Navigation of hierarchical data using climb/dive and spin inputs
摘要 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.
申请公布号 US8788538(B2) 申请公布日期 2014.07.22
申请号 US201113313031 申请日期 2011.12.07
申请人 Microsoft Corporation 发明人 Brinkman Donald
分类号 G06F17/30 主分类号 G06F17/30
代理机构 代理人 Boelitz Carole;Minhas Micky
主权项 1. 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.
地址 Redmond WA US