wangqianwen0418 / DiscriLens

https://qianwen.info/demos/discrilens/
6 stars 1 forks source link

visual design #16

Open wangqianwen0418 opened 5 years ago

wangqianwen0418 commented 5 years ago

visual design

a useful survey of set visualizations:

The State-of-the-Art of Set Visualization, https://doi.org/10.1111/cgf.12722

a summary table

wangqianwen0418 commented 5 years ago

image eulerdiagrams
https://www.microsoft.com/en-us/research/wp-content/uploads/2016/12/eulerdiagrams_infovis2010.pdf

wangqianwen0418 commented 5 years ago

image
image

upset
https://caleydo.org/tools/upset/

wangqianwen0418 commented 5 years ago

overview:

image

updated 2.17 Zhenhua finished the implementation (remove non-key itemsets) image

wangqianwen0418 commented 5 years ago

attributes: image

collapse: finished (qianwen); draggable: is refining (zhenhua); risk_dif details: haven't started;

wangqianwen0418 commented 5 years ago

rules

finished by zhenhua;

  1. show the context of each rule;

in process (qianwen)

think

wangqianwen0418 commented 5 years ago

非常丑的示意图: image

update 2.17 image

wangqianwen0418 commented 5 years ago

slides on 2.17

wangqianwen0418 commented 5 years ago

discuss the current design (2.17):

wangqianwen0418 commented 5 years ago

rules:

a: image

b: image

c: image


feedback: b, c are confusing, similar to donut charts;

modify a and highlight the difference. (whether to use color encoding, decide later) image


a little update (3.5):
saturation to encode the difference image

wangqianwen0418 commented 5 years ago

2.25: settle down the design of Ripples

group items to the minimum units image

the design evolution: image


remaining task:

  1. [x] encoding: color or texture;
  2. [x] interactive boundaries;
  3. [x] a modified layout algorithm to ensure circles belonging to the same set are put together;

update 3.9. feedback: the current annotation can be misleading. e.g., ABCD is a subset of ABC. Update the annotation: image

wangqianwen0418 commented 5 years ago

3.3 updates: the basic idea for the layout algorithm: image

  1. build a graph of these minimum units, remove extra edges:
    the purpose of this graph, connect subsets belonging to the same set with the minimum number of links.
    thus: a) no circles; b) share links as much as possible;
    how:

    • first, connect all units belonging to one set;
    • run MST on each set, weigh of each edge= number of sets that have this link;
    • merge the MST of each set image
  2. layout based on voronoi, killed:
    image

  3. layout based on front chain packing image

image image

wangqianwen0418 commented 5 years ago

two encoding scheme: a:
image

b: image

wangqianwen0418 commented 5 years ago

update 3.9: About alignment image image

wangqianwen0418 commented 5 years ago

Plan for the comparison: image