| 摘要 |
PROBLEM TO BE SOLVED: To reduce the cost by automatically generating a road network. SOLUTION: Polyline figures or polygone diagrams constituting road diagrams are disassembled into individual lines among vertexes and center coordinates and lengths of the lines are registered in a line retrieval data structure and the longest preceding line F1 is taken out and a pair line F2 is detected and the center coordinates of end points of F1, F2 are calculated and the relation between a line L1 and F1, F2 is held in a line management table. Moreover, lines are extended and a point at the point of time when the extensions of the lines open at an intersection is made an interruption point and the line coordinates of a line at the time when both ends of the extensions are interrupted are registered in the line management table and lines of the road network are generated by repeating a series of processings until pair lines become not to be detected and interruption points are registered in the structure of an interruption point retrieval data. Furthermore, the center of plural pieces of interruption points is calculated by setting a search circle area around an arbitrary interruption points to be registered in a connecting point table as a connecting point and this interruption point connecting process is performed until the connecting objects of interruption points are extinguished.
|
