The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree (ENPT), and in a Grid (ENPG). It was shown that ENPG contains an infinite hierarchy of subclasses that are obtained by restricting the number of bends in the paths. Motivated by thi...

In river meandering, when flow passes through a bend, reduction of flow velocity and rising hydrostatic pressure cause super elevation phenomena at outer side and reduction of water surface at inner-side of the bend. A helical motion results, causing erosion of the outer side of the bend. Installation of submerged vanes on the stream bed can reduce erosion of the outer bank significantly. In th...

In this paper, we present a general scheme to produce interactive and static orthogonal drawings of graphs. As opposed to most known algorithms, we do not restrict ourselves to graph with maximum degree 4, but allow arbitrary degrees. We show here how, with one speciic implementation of the scheme, we can obtain an m+n 2 m+n 2-grid for all simple connected graphs without nodes of degree 1. Furt...

This study investigated whether the "constant limb force" hypothesis can be applied to bend sprinting on an athletics track and to understand how force production influences performance on the bend compared with the straight. Force and three-dimensional video analyses were conducted on seven competitive athletes during maximal effort sprinting on the bend (radius 37.72 m) and straight. Left ste...

Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a onedimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results. An experimental evaluation shows that we were able to reduce the total edge length and the drawing...

Investigating the features and flow behavior and related component is one of the complex phenomena that make using of software inevitable. The rivers carry sediment content along with water which is created by erosion of riverbed sediment and erosion caused by rainfall or surface runoff flowing over the catchment area. If the action of river dewatering occurs, the entry of sediment into the int...

This paper discusses the calculation of bend minimal shapes for non-planar graphs with given topology. Based on the Simple-Kandinsky drawing standard – a simplification of the more complex Kandinsky standard – we show the disadvantage of using standard models for this task: We show that the minimal bend count is suboptimal, when these models are applied to non-planar graphs; it is therefore ben...

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...

A rigorous classical analytic model of confined optical wave propagation along 2-D bent slab waveguides and curved dielectric interfaces is investigated, based on a piecewise frequency domain ansatz for bend mode profiles in terms of Bessel and Hankel functions. This approach provides a clear picture of the behaviour of bend modes, concerning their decay for large radial arguments or effects of...