What to Draw? When to Draw? An Essay on Parallel Program Visualization

What to Draw? When to Draw? An Essay on Parallel Program Visualization

Parallel programs are difficult to understand and the research community is determined to provide tools to help improve that understanding. As a result, there is intense interest in using visualization to understand the execution of parallel programs. But visualization is like the surgeon’s knife: properly used it will quickly cut to the essentials; improper use brings colorful but disastrous r...

Learning What and Where to Draw

Generative Adversarial Networks (GANs) have recently demonstrated the capability to synthesize compelling real-world images, such as room interiors, album covers, manga, faces, birds, and flowers. While existing models can synthesize images based on global constraints such as a class label or caption, they do not provide control over pose or object location. We propose a new model, the Generati...

How to Draw the Minimum

A Simple Parallel Algorithm to Draw Cubic Graphs

ÐThe main contribution of this work is to offer a simple and cost-efficient parallel algorithm that, given an arbitrary n-vertex cubic graph G as input, produces an orthogonal grid drawing of G in O…logn† time, using n processors on an EREW PRAM. Our algorithm matches the time and cost performance of the best previously-known algorithm while at the same time improving the constant factors invol...

On How to Draw a Graph

We give an overview of Tutte’s paper, “How to draw a graph”, that contains: (i) a proof that every simple 3-connected planar graph admits a straight-line embedding in the plane such that each face boundary is a convex polygon, (ii) an elegant algorithm for finding such an embedding, (iii) an algorithm for testing planarity, and (iv) a proof of Kuratowski’s theorem.