Sciweavers

Share
13 search results - page 3 / 3
» Three-Dimensional Orthogonal Graph Drawing with Optimal Volu...
Sort
View
SOFSEM
2016
Springer
3 years 6 months ago
Orthogonal Layout with Optimal Face Complexity
Given a biconnected plane graph G and a nonnegative integer k, we examine the problem of deciding whether G admits a strict-orthogonal drawing (i.e., an orthogonal drawing without ...
Muhammad Jawaherul Alam, Stephen G. Kobourov, Deba...
GD
2001
Springer
9 years 2 months ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
9 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
books