TY - JOUR
T1 - IsoMatch
T2 - Creating Informative Grid Layouts
AU - Fried, O.
AU - Diverdi, S.
AU - Halber, M.
AU - Sizikova, E.
AU - Finkelstein, A.
N1 - Publisher Copyright:
© 2015 The Author(s) Computer Graphics Forum © 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd.
PY - 2015/5/1
Y1 - 2015/5/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84932088868&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84932088868&partnerID=8YFLogxK
U2 - 10.1111/cgf.12549
DO - 10.1111/cgf.12549
M3 - Article
AN - SCOPUS:84932088868
SN - 0167-7055
VL - 34
SP - 155
EP - 166
JO - Computer Graphics Forum
JF - Computer Graphics Forum
IS - 2
ER -