نتایج جستجو برای: rectilinear street network
تعداد نتایج: 700610 فیلتر نتایج به سال:
Given a nite set V of points in the plane (called terminals), the rectilinear Steiner minimal tree is a shortest network of horizontal and vertical lines connecting all the terminals of V. The decision form of this problem has been shown to be NP-complete 8]. A new algorithm is presented that computes provably optimal Steiner trees using the \FST concatenation" approach. In the \FST generation"...
Introduction: Children, who work or live at streets, are one of the HIV high risk groups in Iran, with no comprehensive preventive programs. This study intended to assess substance use among street children in Tehran, Capital of Iran. Methods: This paper is a part of comprehensive rapid assessment and response (RAR) research on street children in Tehran i...
Streets are large, diverse, and used for several (and possibly conflicting) transport modalities as well as social and cultural activities. Proper planning is essential and requires data. Manually fabricating data that represent streets (street reconstruction) is error-prone and time consuming. Automatising street reconstruction is a challenge because of the diversity, size, and scale of the de...
The objectives of this manuscript are (1) to evaluate the effectiveness of on-street bicycle lane in reducing crashes involving bicyclists on urban roads, (2) to quantify and compare risk to bicyclists on road segments with and without on-street bicycle lane, (3) to evaluate the effect of on-street bicycle lane on other road network users (all crashes), and, (4) to assess the role of on-network...
ABSTRACT Broadcasting is the process of disseminating a message from a node of a communication network to all other nodes as quickly as possible. In this paper we consider Manhattan Street Networks (MSNs) which are mesh-structured, toroidal, directed, regular networks such that locally they resemble the geographical topology of the avenues and streets of Manhattan. Previous work on these networ...
In this paper we analyse the street network of London both in its primary and dual representation. To understand its properties, we consider three idealised models based on a grid, a static random planar graph and a growing random planar graph. Comparing the models and the street network, we find that the streets of London form a self-organising system whose growth is characterised by a strict ...
Electricity has become are indispensable component in the lives of all today. Street lights are one of the most crucial parts for public sector and urban areas. The traditional street lighting System which controlled manually has disadvantages like high power consumption, high cost and there is no effective monitoring system. This paper is proposes an Automatic Solar Panel Based LED Street Ligh...
We present optimal competitive algorithms for two interrelated known problems involving Steiner Arborescence. One is the continuous problem of the Symmetric Rectilinear Steiner Arborescence (SRSA), studied by Berman and Coulston as a symmetric version of the known Rectilinear Steiner Arborescence (RSA) problem. A very related, but discrete problem (studied separately in the past) is the online ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید