Automated inspection system
US-2024420305-A1 · Dec 19, 2024 · US
Optimizing edge crossing computations when creating a drawing of a directed graph having a minimum number of edge crossings
US8994730B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8994730-B2 |
| Application number | US-23761408-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 25, 2008 |
| Priority date | Sep 25, 2008 |
| Publication date | Mar 31, 2015 |
| Grant date | Mar 31, 2015 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
A candidate graph crossing point counter can be initialized. Level pairs can be sorted in descending order according to a number of connections between the level pairs. Evaluation of the candidate graph can progress according to the order of the level pairs so that those pairs likely to have the greatest number of connections are processed first. While the candidate graph crossing point counter is at an intermediate value and before a crossing point total is calculated for the candidate graph, it can be determined that the intermediate value is at least as great as a crossing point total of a best current graph for the directional graph. Calculation of the candidate graph crossing point total can be halted at the intermediate value. The candidate graph can be discarded from a possibility of being a minimized graph during a determination of a graph drawing for the directional graph.
First claim
Opening claim text (preview).
What is claimed is: 1. A method for optimizing a directional graph computation comprising: initializing, at a computing device, a candidate graph crossing point counter, wherein the candidate graph is an acyclic, layered graph representation of a directional graph, wherein the layered graph comprises a plurality of level pairs, and wherein a sum of the set of crossing point totals per level pair for the plurality of level pairs equals the crossing point total for the layered graph…
Assignees
Inventors
Classifications
- G06T17/00Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US8994730B2 cover?
- A candidate graph crossing point counter can be initialized. Level pairs can be sorted in descending order according to a number of connections between the level pairs. Evaluation of the candidate graph can progress according to the order of the level pairs so that those pairs likely to have the greatest number of connections are processed first. While the candidate graph crossing point counter…
- Who is the assignee on this patent?
- Breeds Robert J, Taunton Philip R, IBM
- What technology area does this patent fall under?
- Primary CPC classification G06T17/00. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 31 2015 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).