2017 21st International Conference Information Visualisation (IV) 2017
DOI: 10.1109/iv.2017.14
|View full text |Cite
|
Sign up to set email alerts
|

Node Overlap Removal for 1D Graph Layout

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 22 publications
(35 reference statements)
0
1
0
Order By: Relevance
“…When several nodes are merged by the user, we position the resulting node at the barycenter of the merged nodes. Then, we use a node overlap removal algorithm 37 to arrange the layout on the axis while preserving the relative distances between the consecutive pairs of nodes. 38 The user can also add links between the nodes to model keyword relationships.…”
Section: Epidvis Designmentioning
confidence: 99%
“…When several nodes are merged by the user, we position the resulting node at the barycenter of the merged nodes. Then, we use a node overlap removal algorithm 37 to arrange the layout on the axis while preserving the relative distances between the consecutive pairs of nodes. 38 The user can also add links between the nodes to model keyword relationships.…”
Section: Epidvis Designmentioning
confidence: 99%