IsoMatch: Creating Informative Grid Layouts
نویسندگان
چکیده
Collections of objects such as images are often presented visually in a grid because it is a compact representation that lends itself well for search and exploration. Most grid layouts are sorted using very basic criteria, such as date or filename. In this work we present a method to arrange collections of objects respecting an arbitrary distance measure. Pairwise distances are preserved as much as possible, while still producing the specific target arrangement which may be a 2D grid, the surface of a sphere, a hierarchy, or any other shape. We show that our method can be used for infographics, collection exploration, summarization, data visualization, and even for solving problems such as where to seat family members at a wedding. We present a fast algorithm that can work on large collections and quantitatively evaluate how well distances are preserved.
منابع مشابه
Function-Behaviour-Structure Representation of the Grids in Graphic Design
Grid in graphic design is a well-known tool. It is used for planning and creating graphical layouts. Though lot of empirical literature on grids is available through various case studies and visual samples, there is hardly any articulation of the design process involving grids. This paper tries to present the formalism for design knowledge in application of grids in graphic design. The function...
متن کاملUrban Land-Use Allocation By A Cell-based Multi-Objective Optimization Algorithm
Allocating urban land-uses to land-units with regard to different criteria and constraints is considered as a spatial multi-objective problem. Generating various urban land-use layouts with respect to defined objectives for urban land-use allocation can support urban planners in confirming appropriate layouts. Hence, in this research, a multi-objective optimization algorithm based on grid is pr...
متن کاملThe Recursive Grid Layout Scheme for VLSI Layout of Hierarchical Networks
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchical networks. In particular, we construct optimal VLSI layouts for butterfly networks, generalized hypercubes, and star graphs that have areas within a factor of 1+ o(1) from their lower bounds. We also derive efficient ...
متن کاملNew Results in Graph Layout∗
A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models of graph layout. In particular, we improve on the results of Enomoto and Miyauchi [SIAM J. Discret...
متن کاملAttention Trade-off between Two Types of User Contributions: Effects of Pinterest-Style Infinite Scroll Layouts on Creating Original Sharing and Appreciating Others' Sharing
User contributions are critical to social commerce sites. Prior studies mainly examined motivational factors influencing user contributions. In the current study, we examine effects of interface layouts on user contributions, from the perspective of attention allocation. We also distinguish between the two types of user contributions: creating original sharing and appreciating others’ sharing. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 34 شماره
صفحات -
تاریخ انتشار 2015