描述工程图纸扫描图象的单义域邻接图的构建方法

工程图纸扫描图象的编码是矢量化中一个重要问题。该文首先对二值图象作水平黑游程编码，建立游程部接图来表达图象，然后采用深度优先遍历邻接图，即相关游程基于宽度与拓扑的一致性组成条形域（图的一个路径），分裂其中的多义域得到单义域（线段域和圆弧域）。图象的描述单元变为单义域，再继承游程的拓扑关系，建立单义域邻接图。单义域邻接图较好地描述了图象几何属性和拓扑关系。最后给出基于单义域邻接图的矢量化应用，效果也较好。

A Method of Generating a Primitive Regions Adjacency Graph to Represent Scanned Image of Engineering Drawings

It is an important issue to encode scanned image of engineer drawings for vectorization.The binary image isencoded with black horizontal run-length.Then a run-length adjacency graph is used to represent the image.A striperegion consists of correlative run-lengths with the same width and topology.It is attained by depth first seareh for thegraph.The stripe regions not single shape then can be segmented into some primitive regions (line regions and are regions).Based on a run-length adjacency graph,a primitive regions adjacency graph is generaed to describe geometricalproperty and topological constraint at a more advanced level.The application of vectorization is also intaluced.Some applications of vectorization are finally provided,which show that the algorithm is effechve and robust.