| id |
ddss9437 |
| authors |
Gu, Jing-wen and Chen, Bing-zhao |
| year |
1994 |
| title |
Data Structure and Its Processing in Planar Road Planning |
| source |
Second Design and Decision Support Systems in Architecture & Urban Planning (Vaals, the Netherlands), August 15-19, 1994 |
| summary |
The planning of roads is one of the most important activities in urban planning and design. Even at the early stage of planning, a planner must take the roads and their planar layout into account and should design them as soon as possible. Then he can use the roads as building blocks for further planning, such as land use, underground layout, detailed district planning and road design. In conventional manual design procedures and according to the "Norm of Transport Planning onUrban Road", it is a tedious task to draw property and side lines of the road network in a city or district and to link them properly at road crosses. With the help of computers, it will be possible to do it automatically. In this paper, the data structure we constructed for our PC software for road processing is first introduced. This data structure defines the road level, the widths of side and property lines, the orientation and topological link of one road with other roads. The procedural considerations for road processing are then given. They include the generation of the side lines and property lines, smooth linking between adjacent roads, rounding of arc roadsegments and all of the physical coordinates for the control points on both centre-lines and property lines. When using this system, a planner only needs to input the centre lines of roads and their width. The roads can be either inputted by using a digitizer or directly sketched on the display. The subsequent processing mentioned above is completed automatically, and the resulting geometric data associated with the road network is stored in a database with the same data structure. The specification on the road cross, which is required during the processing, can be changed interactively and globally, and once changed the regeneration of the above process will be finished very fast. |
| series |
DDSS |
| references |
Content-type: text/plain
|
| last changed |
2003/08/07 16:36 |
|
