Page History

...

• Implement Greedy Switch Heuristic for Crossing Minimization
  The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for. 

  Jira
  server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-891

• Layering Algorithms
  Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
• Tight Packing of Connected Components
  Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.

  Jira
  key in (KIPRA-1262,KIPRA-1031) server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution maximumIssues 20 jqlQuery serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1262

  Jira
  server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1031

• Integrate KIML with JGraph
  Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.

  Jira
  showSummary true server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1214

• Improved Edge Label Placement
  Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...

...