Street networks can be visualized in various ways depending on the purpose. Here we introduce (in the present context) a new technique for visualizing the orientation of street networks in relation to complex topography. The technique is tested on the city of Sheffield, England, with a current population of about 555,500 (in 2010) and a total street number of 23,500. Using digital elevation map...

We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...

This paper deals with the analytical modeling and control of rectilinear snake robots. During recent times snake robots have created much interest among researchers. The rectilinear pattern gait is one of the four biological snake locomotion modes. Rectilinear snakes have been widely used in rescue operations especially in rough terrains especially in narrow spaces where human intervention is n...

Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P . Aminimum Manhattan network of P is a Manhattan network of minimum total length. It is unknown whether it is NP-hard to construct a minimum Manhattan network. The best approximations published so far are a combinatorial 3-approximation algori...

Elimination voltammetry with linear scan (EVLS) represents the fast and simple improvement of linear-sweep or cyclic voltammetric results. Through the various elimination functions, EVLS offers a new tool not also for better understanding of complex electrochemical processes on the surface of working electrodes, but also for improving the sensitivity of electrochemical measurements. The paper i...

This paper proposes a novel generalisation model for selecting characteristic streets in an urban street network. This model retains the central structure of a street network, it relies on a structural representation of a street network using graph principles where vertices represent named streets and links represent street intersections. Based on this representation, so-called connectivity gra...

The rectilinear Steiner tree problem is to nd a minimum-length rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rectilinear problem. Furthermore, a number of more direct, geometric algorithms have been devised for ...

Scholars have studied street networks in many ways. However, there are somelimitations to the current urban planning/street network analysis literature. Toaddress these challenges, this study presents a new tool to make the collection ofdata and creation and analysis of street networks simple, consistent, andautomatable. OSMnx is a new Python package that downloads administrativ...