# US 2019/0172233 A1 · System, method and computer program product for electronic document display > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0172233 A1 - Document ID: US20190172233A1 - Status: Published application - Kind: A1 - Application number: 16/270,757 - Filed: 2019-02-08 - Published: 2019-06-06 - Earliest claimed: 2016-09-21 - Assignees: International Business Machines Corporation - Applicants: International Business Machines Corporation - Inventors: Keke Cai; Dongxu Duan; Zhong Su; Li Zhang; Xiaolu Zhang; Shiwan Zhao - Web page: https://patentgrep.com/patent/US20190172233A1 ## CPC - G06T 11/26: Drawing of charts or graphs - G06F 16/31: Indexing; Data structures therefor; Storage structures - G06F 16/34: Browsing; Visualisation therefor (browsing or visualisation for clustering or classification G06F16/358) - G06F 40/134: Hyperlinking - G06T 11/00: Two-dimensional [2D] image generation - G06V 30/18181: {Graphical representation, e.g. directed attributed graph} - G06V 30/414: Extracting the geometrical structure, e.g. layout tree; Block segmentation, e.g. bounding boxes for graphics or text - G06V 40/20: Movements or behaviour, e.g. gesture recognition (recognition of facial expressions G06V40/16) - G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING ## Abstract A method, system, and computer program product, include receiving a first input at a first element among a plurality of elements associated with at least one electronic document, determining a second element associated with the first element from the plurality of elements based on predetermined relations of the plurality of elements, and causing a view to be displayed together with an electronic document including the first element, the view at least including the second element. ## Claims ### Claim 1 A computer-implemented method comprising: building a reference graph which reflects predetermined relations between information units within at least one electronic document; receiving a first input at a first element among a plurality of elements of the information units associated with the at least one electronic document; determining a second element of the information units associated with the first element from the plurality of elements of the information units based on the predetermined relations of the plurality of elements; and causing a view to be displayed together based on the reference graph with an electronic document including the first element, the view at least including the second element. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein the plurality of elements are represented by nodes in a graph, and the predetermined relations of the plurality of elements are represented by edges in the graph between the nodes, wherein the determining the second element comprises determining a first subgraph of the graph including a first plurality of nodes in response to a distance between a first node and each of a first plurality of nodes being less than a predetermined distance threshold and a weight of each of the first plurality of nodes being greater than a predetermined weight threshold, and wherein the predetermined distance threshold and the predetermined weight threshold are configurable by the user. ### Claim 3 (depends on 2) The computer-implemented method of claim 2, wherein the edges in the graph include an undirected edge indicating that elements represented by nodes connected through the undirected edge are in proximity to each other. ### Claim 4 (depends on 1) The computer-implemented method of claim 1, wherein the determining the second element comprises: determining a first node in the graph representing the first element; determining a second node in the graph based on at least one of the following: a distance between the first and second nodes, or weights of nodes between the first and second nodes; and determining an element represented by the second node as the second element. ### Claim 5 (depends on 4) The computer-implemented method of claim 4, wherein the determining the second node further comprises: determining a first subgraph of the graph including a first plurality of nodes in response to determining one of the first plurality of nodes as the second node. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, embodied in a cloud-computing environment. ### Claim 7 A system comprising: a processor; and a memory, the memory storing instructions to cause the processor to perform: building a reference graph which reflects predetermined relations between information units within at least one electronic document; receiving a first input at a first element among a plurality of elements of the information units associated with the at least one electronic document; determining a second element of the information units associated with the first element from the plurality of elements of the information units based on the predetermined relations of the plurality of elements; and causing a view to be displayed together based on the reference graph with an electronic document including the first element, the view at least including the second element. ### Claim 8 (depends on 7) The system of claim 7, wherein the plurality of elements are represented by nodes in a graph, and the predetermined relations of the plurality of elements are represented by edges in the graph between the nodes, wherein the determining the second element comprises determining a first subgraph of the graph including a first plurality of nodes in response to a distance between a first node and each of a first plurality of nodes being less than a predetermined distance threshold and a weight of each of the first plurality of nodes being greater than a predetermined weight threshold, and wherein the predetermined distance threshold and the predetermined weight threshold are configurable by the user. ### Claim 9 (depends on 8) The system of claim 8, wherein the edges in the graph include an undirected edge indicating that elements represented by nodes connected through the undirected edge are in proximity to each other. ### Claim 10 (depends on 7) The system of claim 7, wherein the determining the second element comprises: determining a first node in the graph representing the first element; determining a second node in the graph based on at least one of the following: a distance between the first and second nodes, or weights of nodes between the first and second nodes; and determining an element represented by the second node as the second element. ### Claim 11 (depends on 10) The system of claim 10, wherein the determining the second node further comprises: determining a first subgraph of the graph including a first plurality of nodes in response to determining one of the first plurality of nodes as the second node. ### Claim 12 (depends on 7) The system of claim 7, embodied in a cloud-computing environment. ### Claim 13 A computer program product for electronic document display, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, the program instructions being executable by a computer to cause the computer to: build a reference graph which reflects predetermined relations between information units within at least one electronic document; receive a first input at a first element among a plurality of elements of the information units associated with the at least one electronic document; determine a second element of the information units associated with the first element from the plurality of elements of the information units based on the predetermined relations of the plurality of elements; and cause a view to be displayed together based on the reference graph with an electronic document including the first element, the view at least including the second element. ### Claim 14 (depends on 13) The computer program product of claim 13, wherein the plurality of elements are represented by nodes in a graph, and the predetermined relations of the plurality of elements are represented by edges in the graph between the nodes, wherein the determining the second element comprises determining a first subgraph of the graph including a first plurality of nodes in response to a distance between a first node and each of a first plurality of nodes being less than a predetermined distance threshold and a weight of each of the first plurality of nodes being greater than a predetermined weight threshold, and wherein the predetermined distance threshold and the predetermined weight threshold are configurable by the user. ### Claim 15 (depends on 14) The computer program product of claim 14, wherein the edges in the graph include an undirected edge indicating that elements represented by nodes connected through the undirected edge are in proximity to each other. ### Claim 16 (depends on 13) The computer program product of claim 13, wherein the determining the second element comprises: determining a first node in the graph representing the first element; determining a second node in the graph based on at least one of the following: a distance between the first and second nodes, or weights of nodes between the first and second nodes; and determining an element represented by the second node as the second element. ### Claim 17 (depends on 16) The computer program product of claim 16, wherein the determining the second node further comprises: determining a first subgraph of the graph including a first plurality of nodes in response to determining one of the first plurality of nodes as the second node. ### Claim 18 (depends on 13) The computer program product of claim 13, wherein the determining the second element comprises: determining a first node in the graph representing the first element; determining a second node in the graph based on at least one of the following: a distance between the first and second nodes, or weights of nodes between the first and second nodes; and determining an element represented by the second node as the second element, and wherein the determining the second node comprises determining a first subgraph of the graph including a first plurality of nodes in response to determining one of the first plurality of nodes as the second node. ### Claim 19 (depends on 13) The computer program product of claim 13, wherein determining the second element comprises: determining a first node in the graph representing the first element; determining a second node in the graph based on a distance between the first and second nodes and weights of nodes between the first and second nodes; and determining an element represented by the second node as the second element. ### Claim 20 (depends on 13) The computer program product of claim 13, wherein the determining the second element associated with the first element determines the association based on a relationship between the elements, the relationship including definition, reference, dependency, inclusion, and peer.