We present a fast and simple method to compute bundled layouts of general graphs, dynamic graphs and temporal paths. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply an image sharpening technique which progressively merges local height maxima by moving the convolved graph edges into the height gradient flow. We show how these techniques can produce simplified visualizations of static, streaming and sequence graphs. We illustrate our techniques with datasets from aircraft monitoring, software engineering, and eye-tracking of static and dynamic scenes
