Titlebook: ;

弓箭

苦澀

Entropion

Difference Metrics for Interactive Orthogonal Graph Drawing Algorithmstal map. Additional work needs to be done to formulate and validate “difference” metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings of the same graph.

符合規(guī)定

fleeting

A Split&Push Approach to 3D Orthogonal Drawing final drawing through a sequence of steps, starting from a “degenerate” drawing. At each step the drawing “splits” into two pieces and finds a structure more similar to its final version. Also, we test the effectiveness of our approach by performing an experimental comparison with several existing algorithms.

手術(shù)刀

Algorithmic Patterns for Orthogonal Graph Drawings motivated by the goals of making the algorithm modular and extensible and of providing many reusable components of the algorithm. This work is part of the jdsl project aimed at creating a library of data structures and algorithms in Java.

全等

Lacerate

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions, the other constructs three dimensional drawings with a footprint of minimum size..Future work will include combinations of these two algorithms: we would like to display as much symmetry as possible in a three dimensional drawing of small footprint.