Human-Computer Interface for Graph Navigation

摘要

Human-Computer interfaces for graph navigation are presented. These interfaces are based on swipe-switches and/or crosspairs, perhaps in further combination with keys. The systems operate by parsing a swipe into segments based on crosspairs and/or segment matches to the ideal paths of swipe-switches. Each segment is then used to navigate to a node or along an edge of the graph. Myriad illustrative applications are provided, notably to text input problems, notably in very small devices such as smart watches. It is shown that text-input can be effectively performed by humans using these interfaces, even for complex scripts such as Devanagari and even in smart watches.

主权项

1) A human-computer interface for navigating graphs comprising 1) a path generator for generating paths through n-dimensional space under direction of said human; 3) a shape of dimension m<=n through which said paths can traverse; 4) a parameterization of said shape; 5) a crossing detector which detects when paths generated by said path generator cross the surface of said shape by entering or exiting said shape, and computes the parameter values of the positions at which said entering or exiting occurs, said crossing detector generating electromagnetic signals representing detected crosses, communicating said signals for further graph navigation processing; 6) given a graph to be navigated by said human using said interface, said graph comprising nodes and edges connected said nodes, a mapping of each navigable node of said given graph to a first range of values in said parameterization, and a mapping of each navigable edge from said each navigable node to a second range of values of said parameterization, said second range contained completely within the complement of said first range of values in said parametrization; 7) a navigator, which receives signals from said crossing detector, and uses said signals to navigate said given graph in consultation of said mapping, such that when said crossing detector detects a crosspair, said crosspair being the entrance of said path in a region of said shape corresponding to said first range, followed by an exit of said path in said second range, with no intervening crosses detected by said crossing detector, then said navigator will navigate in said given graph from said node corresponding to said first range along said edge corresponding to said second range.