𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extraction of contour lines by identification of neighbor relationships on a voronoi line graph

✍ Scribed by Norio Mizutani; Toyohide Watanabe; Yuuji Yoshida; Naoki Okabe


Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
892 KB
Volume
24
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

The studies on automatic extraction of contour lines have attracted interest in building a map information system as an automatic composition of input data. However, many attempts reported so far considered only the local connection relationship of contour lines and did not use global information contained in the whole topographic map. Therefore, they could not cope with extraction of contour lines having various cut forms.

The method proposed in this paper can deal with the interconnection of contour lines which are disconnected within a region enclosed by a curved contour line and also the interconnection of contour lines disconnected in the same region, which were difficult in the existing methods. This was because its processing is based on global information of contour lines contained in a topographic map.

As an example of the global information, the neighbor relationship built by a Voronoi diagram is used. The proposed method is divided into the following five steps: construction of a Voronoi diagram; identification of neighbor relationships of line segments; determination of height relation of line segments; extraction of contour lines; and extraction of pairs of endpoints to be interconnected. Then, while comparing and verifying them with the features of contour lines, disconnected contour lines are identified and extracted. This paper reports the procedures for processing and then considers the effect of the proposed method by experimental results.


πŸ“œ SIMILAR VOLUMES


On the intersection of edges of a geomet
✍ N. Alon; M.A. Perles πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0

A note on the determination of cutoff fr
✍ J. Mazumdar; D. Hill πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 440 KB

The method of contour lines in conjunction with the method of conformal mapping is used for the determination of cutoff frequencies of hollow waveguides with arbitrary boundary cross-sections. Calculations are presented .for acoustically soft waveguides. Examples of numerical evaluation are presente