User interface for presenting multi-level map clusters
US-2024401465-A1 · Dec 5, 2024 · US
Visualization and representation of data clusters and relations
US8970593B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8970593-B2 |
| Application number | US-63323309-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 8, 2009 |
| Priority date | Dec 8, 2009 |
| Publication date | Mar 3, 2015 |
| Grant date | Mar 3, 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.
Relational data can be visualized in a map representation. A plurality of vertices and edges are determined based on a set of data identifying objects (i.e., vertices) and relationships (i.e., edges). The vertices and edges are embedded in a planar graph and a Voronoi diagram is generated based at least the plurality of vertices within a set of bounding-points located at least a distance away from the vertices of the map. A bounding-box is associated with each of the vertices, and a set of points generated along each bounding-box. The Voronoi diagram is generated based on the vertices and the set of points of each bounding-box. Each resulting Voronoi cell associated with a common vertex is merged to form a plurality of common cells (i.e., map). The size of each bounding-box can correlate to the importance of its associated vertex, and the points along the bounding-box can be randomly perturbed.
First claim
Opening claim text (preview).
We claim: 1. A method for visualizing data in a map, the method comprising: identifying a plurality of data objects and a plurality of relationships between respective pairs of data objects; calculating a degree of a relationship between data objects within the respective pairs of data objects, wherein: the data objects within the respective pairs of data objects are identified as unrelated to each other when the degree of the relationship between the data objects within the re…
Assignees
Inventors
Classifications
- G06T11/26Primary
Physics · mapped topic
- G06T11/206Primary
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 US8970593B2 cover?
- Relational data can be visualized in a map representation. A plurality of vertices and edges are determined based on a set of data identifying objects (i.e., vertices) and relationships (i.e., edges). The vertices and edges are embedded in a planar graph and a Voronoi diagram is generated based at least the plurality of vertices within a set of bounding-points located at least a distance away f…
- Who is the assignee on this patent?
- Hu Yifan, Gansner Emden, Kobourov Stephen, and 2 more
- What technology area does this patent fall under?
- Primary CPC classification G06T11/26. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Mar 03 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).