Scipediacontent: Scipediacontent moved page Draft Content 980798341 to Carpendale Wong 2007a

2021-01-28T17:10:48Z

Scipediacontent moved page Draft Content 980798341 to Carpendale Wong 2007a

Scipediacontent: Created page with " == Abstract == Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently,..."

2021-01-28T17:10:45Z

Created page with " == Abstract == Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently,..."

New page

== Abstract ==

Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently, we introduced the idea of providing tools that offer interactive edge bending as a method by which edge congestion can be disambiguated. We extend this direction, presenting a new tool, Edge Plucking, which offers new interactive methods to clarify node-edge relationships. Edge Plucking expands the number of situations in which interactive graph exploration tools can be used to address edge congestion.

== Original document ==

The different versions of the original document can be found in:

* [http://innovis.cpsc.ucalgary.ca/innovis/uploads/Publications/Publications/Wong_2007_SIG.pdf http://innovis.cpsc.ucalgary.ca/innovis/uploads/Publications/Publications/Wong_2007_SIG.pdf]

* [http://core.ac.uk/display/21889149 http://core.ac.uk/display/21889149],
: [https://ui.adsabs.harvard.edu/abs/2007SPIE.6495E..08W/abstract https://ui.adsabs.harvard.edu/abs/2007SPIE.6495E..08W/abstract],
: [https://www.spiedigitallibrary.org/conference-proceedings-of-spie/6495/1/Supporting-interactive-graph-exploration-using-edge-plucking/10.1117/12.704612.full https://www.spiedigitallibrary.org/conference-proceedings-of-spie/6495/1/Supporting-interactive-graph-exploration-using-edge-plucking/10.1117/12.704612.full],
: [https://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=1298650 https://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=1298650],
: [https://prism.ucalgary.ca/handle/1880/45775 https://prism.ucalgary.ca/handle/1880/45775],
: [https://dblp.uni-trier.de/db/conf/vda/vda2007.html#WongC07 https://dblp.uni-trier.de/db/conf/vda/vda2007.html#WongC07],
: [https://academic.microsoft.com/#/detail/2076489690 https://academic.microsoft.com/#/detail/2076489690]

* [http://proceedings.spiedigitallibrary.org/proceeding.aspx?doi=10.1117/12.704612 http://proceedings.spiedigitallibrary.org/proceeding.aspx?doi=10.1117/12.704612],
: [http://dx.doi.org/10.1117/12.704612 http://dx.doi.org/10.1117/12.704612]

← Older revision	Revision as of 17:10, 28 January 2021
(No difference)

Carpendale Wong 2007a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 980798341 to Carpendale Wong 2007a

Scipediacontent: Created page with " == Abstract == Excessive edge density in graphs can cause serious readability issues, which in turn can make the graphs difficult to understand or even misleading. Recently,..."