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

袁灯山; 伍江

发布时间：
摘要点击次数： 2789
全文下载次数： 147
DOI: 10.11834/jig.19990472
1999 | Volume 4 | Number 4

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

袁灯山¹, 伍江¹(北京大学计算机研究所文字图形处理国家重点实验室，北京 100871)

摘要

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

关键词

封闭图元内点外点交点线段计算机图形

A Method for Union,Intersection and Trim of Closed Contours

()

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.

Keywords

Closed contour Intern point External point Intersect Point segment

在线采编平台

论文出版

年度会议

下载中心

年度信息