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...

images inspired by the remarkable twists and turns in the shape of pollen grains from different plant species collected by the artist from specimens growing in the gardens' cornfield last summer. Kessler was awarded a three-year grant to work with Madeline Harley at the Micromorphology Unit at Kew. The remarkable shapes of pollen grains reveal important diagnostic features of plants used by sci...

The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT (resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of Edge-Intersecting and NonSplitting Paths in a Tree (ENPT) [2]. In this model, two vertices are adjacent if they represent two intersecting paths of a tree whose union is also a path. In this study we generalize this graph cla...

We present Space-VLBI observations of the quasar 3C 395 which show evidence of the existence of a large bend in the inner parts of its jet, close to the core. This bend would explain why previous Earth-based cm-VLBI observations could not detect the ejection of new moving components, as expected from flux density variability in this source. In general, the observational properties of the jet in...

This paper presents an experimental investigation of an aerosol problem by adopting two methods. One approach utilizes scanning electron microscope to study the realistic aerosol deposition status in a typical duct bend. Through scanning electron microscope images and on-site observation, the aerosols tend to deposit and accumulate more on the outer bend wall and bend outlet wall. The other app...