封闭图元求并、交、差的方法

袁灯山; 伍江

doi:10.11834/jig.19990472

学术论文与技术报告 | 浏览量 : 0 下载量: 153 CSCD: 0

PDF
导出
分享
收藏
专辑

封闭图元求并、交、差的方法
A Method for Union,Intersection and Trim of Closed Contours
1999年4卷第4期页码：299
纸质出版：1999
DOI： 10.11834/jig.19990472
稿件说明：

移动端阅览

袁灯山, 伍江. 封闭图元求并、交、差的方法[J]. 中国图象图形学报, 1999,4(4):299. DOI： 10.11834/jig.19990472.

A Method for Union,Intersection and Trim of Closed Contours[J]. Journal of Image and Graphics, 1999, 4(4): 299. DOI： 10.11834/jig.19990472.

摘要

简述了问题提出的原因，讨论了求封闭图元的并、交、差的方法，阐述了算法及实现的具体过程。该算法的特点是思路简捷，将这三种运算统一了起来，同时指出了它们的不同点。

Abstract

This paper discusses the method for counting the union

intersection and trim of closed contours. The“reason”for bringing up the question is introduced. The theory and implementation of the algorithm are described detailedly. The algorithm is simple which combines the three counting operations in one. And the differences among the three counting operations are given.