7405 search results - page 884 / 1481 » Computer Graphics |
170
Voted
GD
1998
Springer
15 years 9 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
141
click to vote
VISUALIZATION
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vectordata in unsteadyflow fields. Using the Line Integral Convolution (LIC) as the underlying method, ...
152
Voted
VISUALIZATION
1997
IEEE
15 years 9 months ago
1997
IEEE
Oriented Line Integral Convolution (OLIC) illustrates flow fields by convolving a sparse texture with an anisotropic convolution kernel. The kernel is aligned to the underlying ...
127
click to vote
DCC
1996
IEEE
15 years 9 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
147
click to vote
GD
1997
Springer
15 years 9 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...