This paper presents compiler technology that targets general purpose microprocessors augmented with SIMD execution units for exploiting data level parallelism. FFT kernels are accelerated by automatically vectorizing blocks of straight line code for processors featuring two-way short vector SIMD extensions like AMD’s 3DNow! and Intel’s SSE 2. Additionally, a special compiler backend is introduc...

We show that every c-planar clustered graph has a straight-line c-planar drawing in which each cluster is represented by an axis-parallel rectangle, thus solving a problem posed by Eades, Feng, Lin, and Nagamochi [Algorithmica, 2006 ].

This paper investigates, how straight lines are mapped to the non-Euclidean log-polar image plane and how their properties in logpolar coordinates can be used to perform two fundamental measurement operations: the construction of straight lines of given orientation angle and the measurement of distances along these lines. It is shown, how the two operations can be efficiently implemented for di...

We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The characterization enables a linear-time testing algorithm to determine whether an almostplanar graph admits a straight-line drawing, and a linear-time drawing algorithm that...