Image processing apparatus, image processing method, and storage medium
US-2024428519-A1 · Dec 26, 2024 · US
Generating animated voronoi treemaps to visualize dynamic hierarchical data with node insertion
US8952964B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8952964-B2 |
| Application number | US-83458310-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 12, 2010 |
| Priority date | May 28, 2010 |
| Publication date | Feb 10, 2015 |
| Grant date | Feb 10, 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.
Methods and apparatus are disclosed for generating animated treemaps, such as Voronoi treemaps, with node insertion to visualize dynamic hierarchical data. A treemap is processed by obtaining a multi-level tessellation having a plurality of existing regions; and inserting at least one new region into the multi-level tessellation by adjusting one or more of a size and location of at least one of the existing regions. In this manner, a stability of the treemap is preserved. The insertion selects a vertex of the multi-level tessellation as an insertion point. The selected vertex can be selected randomly from a set of vertices that define regions that are siblings to the newly inserted region; or can be a known location. A weight can be assigned to a new Voronoi generator, such as a nominal weight according to one or more constraints of the tessellation.
First claim
Opening claim text (preview).
What is claimed is: 1. A method for processing a treemap, comprising: obtaining a multi-level tessellation having a plurality of existing regions; inserting at least one new region into the multi-level tessellation by adjusting one or more of a size and location of at least one of the existing regions, wherein a vertex of the multi-level tessellation is randomly selected as an insertion point from a set of vertices that define regions that are siblings to the newly inserted regi…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06T17/20Primary
Physics · mapped topic
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 US8952964B2 cover?
- Methods and apparatus are disclosed for generating animated treemaps, such as Voronoi treemaps, with node insertion to visualize dynamic hierarchical data. A treemap is processed by obtaining a multi-level tessellation having a plurality of existing regions; and inserting at least one new region into the multi-level tessellation by adjusting one or more of a size and location of at least one of…
- Who is the assignee on this patent?
- Gotz David Haim, IBM
- What technology area does this patent fall under?
- Primary CPC classification G06T17/20. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Feb 10 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).