Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length, simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear p...

Let G be a graph on n vertices; let S be a set of n points in general position (no three of them collinear) in the plane. A rectilinear drawing of G is a drawing of G in the plane that satisfies the following. Its vertices are points in general position and its edges are drawn as straight line segments. The number of crossings of a rectilinear drawing is the number of pairs of its edges that cr...

For a set S of n points in the plane, a Manhattan network on S is a geometric network G(S) such that, for each pair of points in S, G(S) contains a rectilinear path between them of length equal to their distance in the L1-metric. The minimum Manhattan network problem is a problem of finding a Manhattan network of minimum length. Gudmundsson, Levcopoulos, and Narasimhan proposed a 4-approximatio...

The application of convolution potential voh.ammetry to questions of metal complexation is described. Theoretical relations are derived to show that the stability constants may be directly related to the shift in the peak potential of the semiderivative wave, provided the complexes are labile. Equations are also given for inert and quasilabile complexes. Stability constants for the PbCI, and Cd...

We introduce the French Street Name Signs (FSNS) Dataset consisting of more than a million images of street name signs cropped from Google Street View images of France. Each image contains several views of the same street name sign. Every image has normalized, title case folded ground-truth text as it would appear on a map. We believe that the FSNS dataset is large and complex enough to train a...

Title of Document: DESIGN AND ANALYSIS OF EXAGGERATED RECTILINEAR GAIT-BASED SNAKE-INSPIRED ROBOTS James Kendrick Hopkins Doctor of Philosophy, 2014 Dissertation directed by: Professor S. K. Gupta Department of Mechanical Engineering Snake-inspired locomotion is much more maneuverable compared to conventional locomotion concepts and it enables a robot to navigate through rough terrain. A rectil...