We consider embeddings of planar graphs in R where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of O(n...

We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n + 3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K7, and give asymptotic lower bounds for graph classes of varying connectivity.

In an experimental study of laser sheet bending, a 160W diode laser is used for twodimensional sheet bending of low-carbon steel. The variables investigated include metal sheet thickness, laser scan speed, laser power, laser beam width, and laser scan pass number. Bend surface appearances are also analysed. The laser sheet bend results demonstrate that a 940Nm diode laser is an effective tool f...

The modeling of flood-induced bend scour near embankment toes can provide important information for river engineering, embankment safety warnings, and emergency action management. During the rainy seasons, short-term general scour and bend scour are the most common causes for the failure of reinforced concrete embankments in Taiwan. To gain a deeper understanding of the scouring process near le...

We investigate edge-intersection graphs of paths in the plane grid regarding a parameter called the bend-number. The bend-number is related to the interval-number and the track-number of a graph. We provide new upper and lower bounds of the bend-number of any given simple graph in terms of the coloring number, edge clique covers and the maximum degree. We show that the bend-number of an outerpl...

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

Abstract The design of a Printed Circuit Board (PCB) involves satisfying numerous constraints in terms the positioning components and routing conducting tracks or traces between components. One common constraint is limiting maximum angular bend that trace can make (e.g. to 45°) for several potential reasons including reliability. In this paper, we systematically investigate failure characterist...