请输入您要查询的百科知识:

 

词条 Meurs Challenger
释义

  1. Implementation approach

  2. See also

  3. Notes

  4. External links

  5. References

{{Orphan|date=March 2017}}{{Infobox software
| name = Meurs Challenger
| title = Meurs Challenger
| logo =
| screenshot =
| caption =
| collapsible =
| author =
| developer = Meurs HRM
| released =
| discontinued =
| latest release version =
| latest release date =
| latest preview version =
| latest preview date =
| frequently updated =
| programming language = ActionScript
| operating system = Cross-platform
| platform =
| size =
| language =
| status =
| genre = Visualization
| license =
| website = {{URL|http://www.q1000.ro/challenger/}}
}}Meurs Challenger is an online graph visualization program, with data analysis and browsing.[1]

The software supports several graph layout algorithms, and allows the user to interact with the nodes. The displayed data can be filtered using textual search, node and edge type, or based on the graph distance between nodes. Written in ActionScript, the program runs on Windows, Linux, macOS and other platforms that support the Adobe Flash Player.

Meurs Challenger was the winner at the 2011 edition of the International Symposium on Graph Drawing, in the large graph category.[2]

It is publicly available as a Facebook application, which displays the network graph of the user's friends.[3]

Implementation approach

The main problem in network visualization is to reduce data complexity by projecting a multivariate data matrix onto a lower-dimensional planar display space,[4] which is achieved by proper node positioning.

Meurs Challenger addresses this by combining several different approaches:

  • force-based algorithms
  • modularization techniques
  • clustering
  • node overlap minimization, which is achieved by guaranteeing a minimum edge length between two linked nodes
  • edge length uniformization, using an algorithm that minimizes the total edge length discrepancy of the projected graph
  • grid-based layouts

See also

  • Graph (discrete mathematics)
  • Graph drawing
  • Graph theory
  • Graph (data structure)
  • Social network analysis software
  • GraphML

Notes

1. ^{{harvtxt|Zelina|Bota|Houtman|van Assen|2011}}.
2. ^{{harvtxt|Duncan|Gutwenger|Nachmanson|Sander|2011}}.
3. ^{{Citation|url=http://radar.oreilly.com/2012/04/facebook-visualization-app-friends-experiences.html |title=Visualization of the Week: Clustering your social graph - O'Reilly Radar |publisher=Radar.oreilly.com |date=2012-04-06 |accessdate=2012-05-03|postscript= }}
4. ^{{harvtxt|Salvini|Gnos|2011}}.

External links

  • Official website
  • Facebook application

References

{{refbegin}}
  • {{citation | last1 = Zelina | first1 = Remus| last2 = Bota | first2 = Sebastian| last3 = Houtman | first3 = Siebren | last4 = van Assen | first4 = Jaap Jan | last5 = Hattink | first5 = Bas | doi = 10.1007/978-3-642-25878-7 | pages = 447–448 | contribution = Challenger, a New Way to Visualize Data | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Graph Drawing, 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011, Revised Papers | year = 2011 | contribution-url=http://www.springerlink.com/content/0343550414327133/ | editor1-last = Kreveld | editor1-first = Marc | editor2-last = Speckmann | editor2-first = Bettina | editor2-link = Bettina Speckmann | isbn = 978-3-642-25877-0 | volume = 7034 | title-link = International Symposium on Graph Drawing}}.
  • {{citation | last1 = Duncan | first1 = Christian A. | last2 = Gutwenger | first2 = Carsten | last3 = Nachmanson | first3 = Lev | last4 = Sander | first4 = Georg | doi = 10.1007/978-3-642-25878-7 | pages = 449–455 | contribution = Graph Drawing Contest Report | publisher = Springer-Verlag | series = Lecture Notes in Computer Science | title = Graph Drawing, 19th International Symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011, Revised Papers | year = 2011 | contribution-url=http://www.springerlink.com/content/12416047237n867l/ | editor1-last = Kreveld | editor1-first = Marc | editor2-last = Speckmann | editor2-first = Bettina | isbn = 978-3-642-25877-0 | volume = 7034 | title-link = International Symposium on Graph Drawing }}.
  • {{citation | last1 = Salvini | first1 = M M | last2 = Gnos | first2 = A U | last3 = Fabrikant | first3 = S I | contribution = Cognitively plausible visualization of network data | title = 25th International Cartographic Conference, Paris, FR, 03 July 2011 - 08 July 2011 | year = 2011 | isbn = 978-1-907075-05-6 | doi=10.5167/uzh-49097 }}.
{{refend}}

1 : Graph drawing software

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/21 11:01:41