GD 2008 - PDF Preprint Papers

GD 2008 Graph Drawing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed GD-2008 Paper

click to vote

GD
2008
Springer

164views Computer Graphics» more GD 2008»

Rapid Multipole Graph Drawing on the GPU

14 years 27 days ago

Download graphics.cs.uiuc.edu

Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...

Apeksha Godiyal, Jared Hoberock, Michael Garland, ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	164	Rapid Multipole Graph Drawing on the GPU	claim
2	163	The Binary Stress Model for Graph Drawing	claim
3	153	An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges	claim
4	139	Topology Preserving Constrained Graph Layout	claim
5	139	Drawing (Complete) Binary Tanglegrams	claim
6	138	Dunnart: A Constraint-Based Network Diagram Authoring Tool	claim
7	129	Crossing and Weighted Crossing Number of Near-Planar Graphs	claim
8	128	Tree Drawings on the Hexagonal Grid	claim
9	121	Subdivision Drawings of Hypergraphs	claim
10	117	Succinct Greedy Graph Drawing in the Hyperbolic Plane	claim
11	115	Graph Simultaneous Embedding Tool, GraphSET	claim
12	106	Graph Drawing for Security Visualization	claim
13	103	Connected Rectilinear Graphs on Point Sets	claim
14	102	An Algorithm to Construct Greedy Drawings of Triangulations	claim
15	101	Isometric Diamond Subgraphs	claim
16	100	Visual Analysis of One-to-Many Matched Graphs	claim
17	98	Cyclic Leveling of Directed Graphs	claim
18	96	Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints	claim
19	92	Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights	claim
20	92	Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem	claim
21	90	Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing	claim
22	89	An Experimental Study on Distance-Based Graph Drawing	claim
23	88	Cubic Graphs Have Bounded Slope Parameter	claim
24	79	Policy-Aware Visualization of Internet Dynamics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers