A functional magnetic resonance imaging (fMRI)-compatible fiber-optic bend sensor was investigated to assess whether the device could be used effectively to monitor opening and closing of the jaw during an fMRI experiment at 3 T. In contrast to surface electromyography, a bend sensor fixed to the chin of the participant is fast and easy to use and is not affected by strong electromagnetic field...

The thickness of a graph G = (V,E) with n vertices is the minimum number of planar subgraphs of G whose union is G. A polyline drawing of G in R is a drawing Γ of G, where each vertex is mapped to a point and each edge is mapped to a polygonal chain. Bend and layer complexities are two important aesthetics of such a drawing. The bend complexity of Γ is the maximum number of bends per edge in Γ,...

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of outerplanar graphs is 2. Moreover we improve the formerly known lower and upper bound for the maximum bend-number of planar graphs from 2 and 5 to 3 and 4, ...