Sciweavers

109
Voted
GD
2000
Springer
15 years 7 months ago
A User Study in Similarity Measures for Graph Drawing
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...
Stina S. Bridgeman, Roberto Tamassia
106
Voted
GD
2000
Springer
15 years 7 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
GD
2000
Springer
15 years 7 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
124
Voted
GCSE
2000
Springer
15 years 7 months ago
Mixin-Based Programming in C++
Combinations of C++ features, like inheritance, templates, and class nesting, allow for the expression of powerful component patterns. In particular, research has demonstrated that...
Yannis Smaragdakis, Don S. Batory
118
Voted
GCSE
2000
Springer
15 years 7 months ago
On to Aspect Persistence
Over the recent years aspect-oriented programming (AOP) has found increasing interest among researchers in software engineering. Aspects are ions which capture and localise cross-c...
Awais Rashid