Golden Rectangle Treemap

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordered Treemap Layouts

Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dyna...

متن کامل

Discovering Business Intelligence Using Treemap Visualizations

In a similar manner, alert managers do more than recognize expected patterns in sales cycles, movements in supply chains, or yields in manufacturing. Successful managers are skillful at spotting exceptional events, identifying emerging fashions, and noticing what is missing. When problems develop, they take prompt action to keep plans on schedule. When novel trends emerge, they change plans to ...

متن کامل

Trees in a treemap: visualizing multiple hierarchies

This paper deals with the visual representation of a particular kind of structured data: trees where each node is associated with an object (leaf node) of a taxonomy. We introduce a new visualization technique that we call Trees In A Treemap. In this visualization edges can either be drawn as straight or orthogonal edges. We compare our technique with several known techniques. To demonstrate th...

متن کامل

Pixel-oriented Treemap for multiple displays

We have developed a Pixel-oriented Treemap visualization intended for use on multiple displays with collaborating users. It visualizes the health and status of about a million devices with a Treemap layout. In this paper we describe how we found useful pieces of the VAST 2012 Challenge MC1dataset and discuss how users interacted with this visualization during the analysis.

متن کامل

Worst Case Analysis of TreeMap Data Structure

Data structures with relaxed balance eases the update of shared resources on asynchronous parallel architectures. This improvement is obtained by a better locking scheme of the data structure. In this paper, we describe the complexity and analyze the worst case cost of access operations on such a structure. We propose a data structure with the same properties as Java TreeMap but implemented wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2017

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/787/1/012007