The advances in VLSI technology have led to complex and larger circuits. As the circuits become complex and large, the amount of time required for the design of such circuits increases. The people in the VLSI industry are looking for faster EDA (Electronic Design Automation) tools so as to reduce the design time. Routing is a phase in the design (physical design) of electronic circuits, wherein...

We reduce the problem of computing a rectilinear shortest path between two given points s and t in the splinegonal domain S to the problem of computing a rectilinear shortest path between two points in the polygonal domain. As part of this, we define a polygonal domain P from S and transform a rectilinear shortest path computed in P to a path between s and t amid splinegon obstacles in S. When ...

The success or failure of the street network depends on its reliability. In this article, using resilience analysis, the author studies how the shape and appearance of street networks in self-organised and top-down planned cities influences urban transport. Considering London and Beijing as proxies for self-organised and top-down planned cities, the structural properties of London and Beijing n...

OpenStreetMap offers an underexplored source of worldwide geospatial data useful to urban researchers. This study uses the OSMnx software to automatically download and analyze 27,009 US street networks from OpenStreetMap at metropolitan, municipal, and neighborhood scales—namely, every US city and town (N = 19655), census urbanized area (N = 497), and Zillow-defined neighborhood (N = 6857). It ...

Pattern recognition is an important step in map generalization. Pattern recognition in street network is significant for street network generalization. A grid is characterized by a set of mostly parallel lines, which are crossed by a second set of parallel lines with roughly right angle. Inspired by object recognition in image processing, this paper presents an approach to the grid recognition ...

As a result of OpenStreetMap’s (OSM) openness and wide availability, there is increasing interest in using OSM street network data in routing applications. But due to the heterogeneous nature of Volunteered Geographic Information (VGI) in general and OSM in particular, there is no universally valid answer to questions about the quality of these data sources. In this paper we address the lack of...

The authors propose a topological analysis of large urban street networks based on a computational and functional graph representation. This representation gives a functional view in which vertices represent named streets and edges represent street intersections. A range of graph measures, including street connectivity, average path length, and clustering coefficient, are computed for structura...

Centrality measures describe structural properties of nodes (and edges) in a network. Betweenness centrality (Freeman 1977) is one of them, characterizing on how many shortest paths a node is. So far, network analysis concentrates on structural, i.e., topological properties of networks, and on static formulations of centrality. Although travel networks can be studied this way, they deviate from...

The vehicular flow in the urban street canyon is considered. The classical field description is used in the modelling of the vehicular movement and of gaseous mixture in generic urban street canyon. The dynamical variables include vehicular densities, velocities, and emissivities: of pollutants, heat and exhaust gases, as well as standard mixture components' variables: densities, velocities, te...