computer graphics | Sciweavers

30

click to vote

GD
1997
Springer

104views Computer Graphics» more GD 1997»

NicheWorks - Interactive Visualization of Very Large Graphs

14 years 3 months ago

Download www.cs.dartmouth.edu

Graham J. Wills

claim paper

Read More »

45

click to vote

GD
1997
Springer

122views Computer Graphics» more GD 1997»

Area Requirements for Drawing Hierarchically Planar Graphs

14 years 3 months ago

Download www.cse.unsw.edu.au

d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...

Xuemin Lin, Peter Eades

claim paper

Read More »

40

click to vote

GD
1997
Springer

163views Computer Graphics» more GD 1997»

Implementing a General-Purpose Edge Router

14 years 3 months ago

Download www.cs.princeton.edu

Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...

David P. Dobkin, Emden R. Gansner, Eleftherios Kou...

claim paper

Read More »

39

click to vote

GD
1997
Springer

107views Computer Graphics» more GD 1997»

Minimum-Area h-v Drawings of Complete Binary Trees

14 years 3 months ago

Download www.dia.unisa.it

Pierluigi Crescenzi, Paolo Penna

claim paper

Read More »

24

click to vote

GD
1997
Springer

88views Computer Graphics» more GD 1997»

Graph Drawing and Manipulation with LINK

14 years 3 months ago

Download www.cs.rpi.edu

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldber...

claim paper

Read More »

31

click to vote

GD
1997
Springer

130views Computer Graphics» more GD 1997»

Design Gallery Browsers Based on 2D and 3D Graph Drawing

14 years 3 months ago

Download www.merl.com

Brad Andalman, Kathy Ryall, Wheeler Ruml, Joe Mark...

claim paper

Read More »

36

click to vote

GD
1997
Springer

127views Computer Graphics» more GD 1997»

Orthogonal 3-D Graph Drawing

14 years 3 months ago

Download www.cs.brown.edu

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...

Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...

claim paper

Read More »

29

click to vote

DCC
1996
IEEE

104views Computer Graphics» more DCC 1996»

Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm

14 years 3 months ago

Download www.hpl.hp.com

Marcelo J. Weinberger, Gadiel Seroussi, Guillermo ...

claim paper