force directed diagrams
play

Force-directed diagrams Philippe Van Kerm University of Luxembourg - PowerPoint PPT Presentation

Oct 18, 2022 •10 likes •560 views

Fancy graphics #1 Force-directed diagrams Philippe Van Kerm University of Luxembourg and LISER 2020 e-London Stata user group meeting September 11, 2020 [ Outline ] Examples Principles and mechanics Implementation Examples Principles and

  1. Fancy graphics #1 Force-directed diagrams Philippe Van Kerm University of Luxembourg and LISER 2020 e-London Stata user group meeting September 11, 2020

  2. [ Outline ] Examples Principles and mechanics Implementation

  3. Examples Principles and mechanics Implementation

  4. My starting point... a: AGRCULTURE, FORESTRY, FISHERY b-e: MINING AND QUARRYING/MANUFACTURING/ELECTRICITY GAS STEAM AIR CONDITIONING SUPPLY/WATER SUPPLY; (+ OTHER INDUSTRIES) f: CONSTRUCTION g: WHOLESALE AND RETAIL TRADE; REPAIR OF MOTOR VEHICLES AND MOTORCYCLES h: TRANSPOT AND STORAGE i: ACCOMMODATION AND FOOD SERVICE ACTIVITIES j: INFROMATION AND COMMUNICATION k: FINANCIAL AND INSURANCE ACTIVITIES l-n: REAL ESTATE ACTIVITIES, PROFESSIONAL SCIENTIFIC AND TECHNICAL ACTIVITIES/ADMINISTRATIVE AND SUPPORT SERVICE ACTIVITIES o: PUBLIC ADMINISTRATION AND DEFENCE; COMPULSORY SOCIAL SECURITY p: EDUCATION q: HUMAN HEALTH AND SOCIAL WORK ACTIVITIES r - u: R-U:ARTS ENTERTAINMENT AND RECREATION/OTHER SERVICE ACTIVITIES/ACTIVITIES OF HOUSEHOLDS AS EMPLOYERS; (+ FEW OTHERS) a b - e f g h i j k l - n o p q r - u

  5. Network visualisation (as a force-directed diagram) Economic sectors in the bedroom – The matrix is a network 7 – Each sector is a node 13 – Sectors with strong ‘bedroom 2 4 association’ located near each other 6 3 10 9 – (See Thomas Grund’s ♥✇❝♦♠♠❛♥❞s 12 8 for serious network analysis with 1 Stata; Corten (SJ, 2011), Miura (SJ, 5 2012).) 11

  6. Network visualisation (as a force-directed diagram) Economic sectors in the bedroom – The matrix is a network 7 – Each sector is a node 13 6 – Sectors with strong ‘bedroom 4 3 association’ located near each other 2 10 9 – (See Thomas Grund’s ♥✇❝♦♠♠❛♥❞s 12 8 1 for serious network analysis with Stata; Corten (SJ, 2011), Miura (SJ, 5 2012).) 11

  7. Another network visualisation (as a force-directed diagram) Echternach Vianden Diekirch Grevenmacher Clervaux Mersch Wiltz Remich Redange Luxembourg Capellen Esch

  8. Another network visualisation (as a force-directed diagram) Echternach Vianden Diekirch Grevenmacher Clervaux Mersch Wiltz Remich Redange Luxembourg Capellen Esch

  9. Another network visualisation package in the making � � � � ❢❞♥❡t❣r❛♣❤ varname if in ✱ ❧✐♥❦s✭ fromvar tovar Echternach Vianden � [strengthvar] ✮ s❤♦✇❧✐♥❦s✭✳✳✳✮ ✈❛r❝♦❧♦r✭✈❛r♥❛♠❡✮ Diekirch Grevenmacher Clervaux � ✳✳✳ Wiltz Mersch Remich Redange Luxembourg (too many options to discuss here (fiddling with the Capellen construction and display options; see below)) Esch

  10. Other force-directed diagrams: ‘beeswarm’ plots Worried about the economy?

  11. Other force-directed diagrams: ‘beeswarm’ plots Worried about the economy? Worried about the economy in general? Not at all (left) A lot (right)

  12. Other force-directed diagrams: ‘beeswarm’ plots Worried your own finances? Worried about Your own financial situation? Not at all (left) A lot (right)

  13. Other force-directed diagrams: ‘beeswarm’ plots Worried your health? Worried about your own health? Not at all (left) A lot (right)

  14. Other force-directed diagrams: ‘beeswarm’ plots Worried about your friend and family’s health? Worried about health of friends and family? Not at all (left) A lot (right)

  15. Variations on the same theme: other ‘beeswarm’ plots February ... The evolution of employment: telework, short-time employment, ‘parental’ leave, sick leave, job loss February early April June

  16. Variations on the same theme: other ‘beeswarm’ plots April ... The evolution of employment: telework, short-time employment, ‘parental’ leave, sick leave, job loss February early April June

  17. Variations on the same theme: other ‘beeswarm’ plots end May / early June ... The evolution of employment: telework, short-time employment, ‘parental’ leave, sick leave, job loss February early April June

  18. A beeswarm plot package in the making April ... � � � � ❜❡❡s✇❛r♠ ❬ varname ❪ if in ✱ � � ✳✳✳✈❛r❝♦❧♦r✭✈❛r♥❛♠❡✮ ✈❛rs②♠❜♦❧✭✈❛r♥❛♠❡✮✳✳✳ (too many options to discuss here (fiddling with the construction, the display, the choice of locations etc.; see below))

  19. What is the commonality? April ... Echternach Vianden Diekirch Grevenmacher Clervaux Wiltz Mersch Remich Redange Luxembourg Capellen Esch

  20. What is the commonality? April ... – Simple scatterplots... – ... but elements have no pre-defined location on the canvas – Key to the drawing is calculating the plotting positions!

  21. Examples Principles and mechanics Implementation

  22. Force-directed layouts – Element positions determined by a stochastic simulation algorithm – Elements “interact” with each other in order to find their position on the canvas – Interactions through combinations of few simple forces: » Gravitational forces (positive or negative; attractions or repulsion) » Spring forces (towards target distances) » Collisions – Start from random positions and iterate until convergence to a stable plot – Stochastic: randomness in the resulting plot (set your s❡❡❞ )!

  23. Force-directed layouts – Element positions determined by a stochastic simulation algorithm – Elements “interact” with each other in order to find their position on the canvas – Interactions through combinations of few simple forces: » Gravitational forces (positive or negative; attractions or repulsion) » Spring forces (towards target distances) » Collisions – Start from random positions and iterate until convergence to a stable plot – Stochastic: randomness in the resulting plot (set your s❡❡❞ )!

  24. Force-directed layouts – Element positions determined by a stochastic simulation algorithm – Elements “interact” with each other in order to find their position on the canvas – Interactions through combinations of few simple forces: » Gravitational forces (positive or negative; attractions or repulsion) » Spring forces (towards target distances) » Collisions – Start from random positions and iterate until convergence to a stable plot – Stochastic: randomness in the resulting plot (set your s❡❡❞ )!

  25. Different combination of forces lead to different types of plots Attraction forces between points and Spring forces to target connected node towards ‘anchors’ (hives) + collisions distances and repulsion April ... Echternach Vianden Diekirch Grevenmacher Clervaux Wiltz Mersch Remich Redange Luxembourg Capellen Esch

  26. Example for a beeswarm plot Positioning trail

  27. Example for a beeswarm plot Positioning trail

  28. Example for a beeswarm plot Positioning trail

  29. Example for a beeswarm plot Positioning trail

  30. Example for a beeswarm plot Positioning trail

  31. Example for a beeswarm plot Positioning trail

  32. Example for a beeswarm plot Positioning trail

  33. Example for a beeswarm plot Positioning trail

  34. Example for a beeswarm plot Positioning trail

  35. Example for a beeswarm plot Positioning trail

  36. Example for a beeswarm plot Positioning trail

  37. Example for a beeswarm plot Positioning trail

  38. Example for a beeswarm plot Positioning trail

  39. Example for a beeswarm plot Positioning trail

  40. Example for a beeswarm plot Positioning trail

  41. Example for a beeswarm plot Positioning trail

  42. Example for a beeswarm plot Positioning trail

  43. Example for a beeswarm plot Positioning trail

  44. Example for a beeswarm plot Positioning trail

  45. Example for a beeswarm plot Positioning trail

  46. Example for a beeswarm plot Positioning trail

  47. Example for a beeswarm plot Positioning trail

  48. Example for a beeswarm plot Positioning trail

  49. Example for a beeswarm plot Positioning trail

  50. Example for a beeswarm plot Positioning trail

  51. Examples Principles and mechanics Implementation

Recommend

Generalized Force Directed Relaxation with Optimal Regions and Its Applications to Circuit

Generalized Force Directed Relaxation with Optimal Regions and Its Applications to Circuit

Generalized Force Directed Relaxation with Optimal Regions and Its Applications to Circuit Placement: A Tribute to Professor Satoshi Goto Yao-Wen Chang ywchang@ntu.edu.tw National Taiwan University March 21, 2017 1 Goto Force Directed

605 views • 33 slides
D3 Tutorial Force-directed Layout Edit by Jiayi Xu and Han-Wei Shen, The Ohio State University

D3 Tutorial Force-directed Layout Edit by Jiayi Xu and Han-Wei Shen, The Ohio State University

D3 Tutorial Force-directed Layout Edit by Jiayi Xu and Han-Wei Shen, The Ohio State University Force-directed Layout Automatically position nodes in an aesthetically pleasing way Uses a physics based simulator for positioning visual

644 views • 32 slides
Understanding force-directed placement Andrew Kennings Electrical and Computer Engineering

Understanding force-directed placement Andrew Kennings Electrical and Computer Engineering

Understanding force-directed placement Andrew Kennings Electrical and Computer Engineering University of Waterloo 1 Outline of talk Introduction. Implementation details. Force computation. Force scaling. Overlap

635 views • 39 slides
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp

Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition Fabian Lipp Alexander Wolff Johannes Zink Julius-Maximilians-Universitt Wrzburg September 24, Graph Drawing 2015 Introduction Classical force-directed

625 views • 60 slides
Our Charge The task force is hereby authorized and directed to study, evaluate, and analyze, a

Our Charge The task force is hereby authorized and directed to study, evaluate, and analyze, a

ALABAMA JUVENILE JUSTICE TASK FORCE Our Charge The task force is hereby authorized and directed to study, evaluate, and analyze, a comprehensive review of the state's juvenile justice system and, using a data-driven approach, develop

886 views • 45 slides
Visualisation and exploration of high-dimensional data using a "force directed

Visualisation and exploration of high-dimensional data using a "force directed

Visualisation and exploration of high-dimensional data using a "force directed placement" method Application to the analysis of genomic signatures. Sylvain Lespinats, Alain Giron, Bernard Fertil Unit INSERM 494, CHU

731 views • 39 slides
Estimating and Visualizing Language Similarities Using Weighted Alignment and Force-Directed

Estimating and Visualizing Language Similarities Using Weighted Alignment and Force-Directed

Estimating and Visualizing Language Similarities Using Weighted Alignment and Force-Directed Graph Layout Gerhard J ager April 24, 2012, Avignon joint work with Armin Buch, David Erschler & Andrei Lupas Gerhard J ager (T ubingen)

676 views • 28 slides
Visualizing Geometric Proofs 3D surface diagrams Lukas Heidemann Diagrams 0-diagrams 1

Visualizing Geometric Proofs 3D surface diagrams Lukas Heidemann Diagrams 0-diagrams 1

Visualizing Geometric Proofs 3D surface diagrams Lukas Heidemann Diagrams 0-diagrams 1 1-diagrams: bead diagrams 2 1-diagrams: bead diagrams 2 2-diagrams: string diagrams 3 2-diagrams: string diagrams 4 2-diagrams: string diagrams 5

696 views • 40 slides
1 The induced current in the closed loop is largest in which one of these diagrams? A B D C

1 The induced current in the closed loop is largest in which one of these diagrams? A B D C

Slide 1 / 25 1 The induced current in the closed loop is largest in which one of these diagrams? A B D C E Slide 2 / 25 2 A loop of wire is placed in a uniform magnetic field directed into the page as shown above. The magnitude of the

611 views • 25 slides
CS137: Today Electronic Design Automation Scheduling Force-Directed SAT/ILP Day

CS137: Today Electronic Design Automation Scheduling Force-Directed SAT/ILP Day

CS137: Today Electronic Design Automation Scheduling Force-Directed SAT/ILP Day 20: November 23, 2005 Branch-and-Bound Scheduling Variants and Approaches 1 2 CALTECH CS137 Fall2005 -- DeHon CALTECH CS137 Fall2005 --

531 views • 14 slides
Todays Lecture INF 111 / CSE 121: UML Software Tools and Methods Package Diagrams

Todays Lecture INF 111 / CSE 121: UML Software Tools and Methods Package Diagrams

Todays Lecture INF 111 / CSE 121: UML Software Tools and Methods Package Diagrams State Transition Diagrams Activity Diagrams y g Communication Diagrams Lecture Notes for Summer Quarter, 2008 Michele Rousseau Set 8

462 views • 7 slides
Courtesy of Prof. Shixia Liu @Tsinghua University Introduction Node-Link diagrams

Courtesy of Prof. Shixia Liu @Tsinghua University Introduction Node-Link diagrams

Courtesy of Prof. Shixia Liu @Tsinghua University Introduction Node-Link diagrams Space-Filling representation Hybrid methods Hierarchies often represented as trees Directed, acyclic graph Two main representation schemes

1.37k views • 41 slides
1 Class Diagrams and Entity Relationship Diagrams (ERD) Class diagrams and ERDs both model the

1 Class Diagrams and Entity Relationship Diagrams (ERD) Class diagrams and ERDs both model the

Tutorial W eek 7 - Class and Entity-Relationship Diagram s 1 Class Diagrams and Entity Relationship Diagrams (ERD) Class diagrams and ERDs both model the structure of a system. Class diagrams represent the dynamic aspects of a system: both

165 views • 14 slides
UML Class Diagrams Steven Zeil February 25, 2013 UML Class Diagrams Outline Class

UML Class Diagrams Steven Zeil February 25, 2013 UML Class Diagrams Outline Class

UML Class Diagrams UML Class Diagrams Steven Zeil February 25, 2013 UML Class Diagrams Outline Class Diagrams 1 A Class, in Isolation 2 Attributes Operations Generalization Relationships 3 Associations 4 Naming Your

948 views • 68 slides
E/R Diagrams Converting E/R Diagrams to Relations DB design is a serious and

E/R Diagrams Converting E/R Diagrams to Relations DB design is a serious and

E/R Diagrams Converting E/R Diagrams to Relations DB design is a serious and possibly complex business. A client may know they want a database, but they don t know what they want in it or how it should look. E/R

977 views • 75 slides
Software Engineering I (02161) Week 7: Sequence Diagrams, Class Diagrams II, Layered Architecture

Software Engineering I (02161) Week 7: Sequence Diagrams, Class Diagrams II, Layered Architecture

Software Engineering I (02161) Week 7: Sequence Diagrams, Class Diagrams II, Layered Architecture Assoc. Prof. Hubert Baumeister DTU Compute Technical University of Denmark Spring 2017 Contents Recap Sequence Diagrams Object-orientation:

497 views • 48 slides
Outline Finish E/R diagrams (Chapter 2) Lecture 08: And E/R diagrams to relations (3.2,

Outline Finish E/R diagrams (Chapter 2) Lecture 08: And E/R diagrams to relations (3.2,

Outline Finish E/R diagrams (Chapter 2) Lecture 08: And E/R diagrams to relations (3.2, 3.3) The relational data model: 3.1 Functional dependencies: 3.4 Wednesday, October 16, 2002 1 2 Product Subclasses to Relations

303 views • 6 slides
Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13:

Voronoi diagrams of line segments Farthest-point Voronoi diagrams More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Computational Geometry Lecture 13: More on Voronoi diagrams Motion planning for a disc

1.69k views • 92 slides
CS 401 Greedy Algorithms Xiaorui Sun 1 Directed Acyclic Graphs (DAG) Def: A DAG is a directed

CS 401 Greedy Algorithms Xiaorui Sun 1 Directed Acyclic Graphs (DAG) Def: A DAG is a directed

CS 401 Greedy Algorithms Xiaorui Sun 1 Directed Acyclic Graphs (DAG) Def: A DAG is a directed acyclic graph, i.e., one that contains no directed cycles. Def: A topological order of a directed graph G = (V, E) is an ordering of its nodes as !

399 views • 17 slides
6.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where

6.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where

6.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where vertices can be ordered in such at way that no vertex has an edge that points to a vertex earlier in the order. This also implies that we can permute

203 views • 3 slides
5.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where

5.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where

5.1 Directed Acyclic Graphs Directed acyclic graphs , or DAGs are acyclic directed graphs where vertices can be ordered in such at way that no vertex has an edge that points to a vertex earlier in the order. This also implies that the adjacency

74 views • 3 slides
Software Design The Dynamic Model Design Sequence Diagrams and Communication Diagrams

Software Design The Dynamic Model Design Sequence Diagrams and Communication Diagrams

Software Design The Dynamic Model Design Sequence Diagrams and Communication Diagrams Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU Ouline UML Development Overview The Requirements,

605 views • 29 slides
wires carry equal currents in the same direction, as shown. The diagrams show end views of the

wires carry equal currents in the same direction, as shown. The diagrams show end views of the

Two very long, parallel conducting wires carry equal currents in the same direction, as shown. The diagrams show end views of the wires and the magnetic force vectors due to current flow. Which diagram best represents the direction of the

414 views • 13 slides
Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed

Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed

Finding Strongly Connected Components Directed Acyclic Graphs Directed Acyclic Graphs Directed Acyclic Graphs (DAG) A directed acyclic graph (or DAG for short) is a directed graph that contains no cycles. Note that the direction of edges is

158 views • 13 slides

More recommend