JCO/APRIL 2010 © 2010 JCO, Inc. C techniques for activating a closing loop are problematic. Cinching the distal end of the archwire can be time-consuming and inaccurate. Tying back an omega loop between the premolars or between the second premolar and first molar is difficult when the interbracket space is narrow. Lacing back the archwire to a hook is possible, but a crimpable hook can come loo...

The Hawaiian-Emperor bend has played a prominent yet controversial role in deciphering past Pacific plate motions and the tempo of plate motion change. New ages for volcanoes of the central and southern Emperor chain define large changes in volcanic migration rate with little associated change in the chain's trend, which suggests that the bend did not form by slowing of the Hawaiian hot spot. I...

In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. Every series-parallel graph is planar. In this paper we give a linear-time algorithm to examine whether a ser...

In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...

A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible n × n-grid. They also showed that such drawings exist if up to n− 3 edges may have a bend. In this paper, we give algorithms for non-aligned planar drawings that imp...

A new criterion for the optimum design of curved dielectric waveguides is proposed. The bends designed according to this model are named matched bends. In the matched bend, the suitable choice of both bending radius and bending angle reduces the total losses of the bend and avoids the leaky-mode excitation at the end of the bend. For a given angle, a discrete number of bending radii that satisf...

In order to define the mean DNA bend angle and distribution of DNA bend angles in the catabolite activator protein (CAP)-DNA complex in solution under standard transcription initiation conditions, we have performed nanosecond time-resolved fluorescence measurements quantifying energy transfer between a probe incorporated at a specific site in CAP, and a complementary probe incorporated at each ...

We present an O(n) algorithm for minimizing the number of bends in an orthogonal drawing of a plane graph. It has been posed as a long standing open problem at Graph Drawing 2003, whether the bound of O(n7/4√logn) shown by Garg and Tamassia in 1996 could be improved. To answer this question, we show how to solve the uncapacitated min-cost flow problem on a planar bidirected graph with bounded c...

Bacteria come in a variety of shapes, as most species elaborate on the ‘default’ sphere to resemble ovoids, rods, bend rods, spirals, branched filaments or other more complicated forms. How cells that are under considerable turgor pressure maintain a nonspherical shape is unclear, though it is known to depend on structural elements on either side of the cytoplasmic membrane: the murein (peptido...