摘要
在提出有向实体概念的基础上,介绍如何通过动态地建立内(外)边界上关键点的有向实体信息链表,运用递归算法实现快速搜寻内(外)边界实体;通过修改有向实体信息链表实现回溯,从而可靠地求作一任意二维封闭图形的内(外)轮廓。然后介绍利用轮廓进行裁剪的δ方法,最后阐述如何运用此装配算法实现多个工程图的自动装配。
The paper, based on the notion of directional entity put forward, introduces how to seek theinner or outer border entities quickly by using recursion algorithm by building the directional entityinformation link list along the inner or outer border of the graphics, and how to realize retrospect bymodifying the generated directional entity information link list in order to solve and get the inner orouter contour of any 2D closed graphics reliably. Then it introduces the δ method to trim withcontour At last, It introduces how to realize automatically assembling of several graphics by usingthis assembly algorithm.
出处
《工程图学学报》
CSCD
2000年第2期6-13,共8页
Journal of Engineering Graphics
基金
国家863计划/CIMS自动化领域项目