摘要
寻找任意线段和圆弧围成的区域问题是建筑结构CAD软件前处理中的一个基本问题。作者通过自己的研究开发经验 ,提出了三个基本算法 ,即如何由输入的线段和圆弧得到网格点、网格线和区域表 。
To search the regions encircled by arbitrary lines and arcs is a basic problem in the design of architecture and structure CAD software. Through his own experience on developing CAD software, the author puts forward three kernel algorithms including how to get all mesh points, mesh lines and region tables from the input datum of the arbitrary lines and arcs so that gets a new algorithm to search the regions encircled by arbitrary lines and arcs. Practice has proved that the algorithm is reliable.
出处
《计算机应用》
CSCD
北大核心
2001年第10期36-37,40,共3页
journal of Computer Applications
关键词
网格点
输入线
网格线
区域
建筑结构
算法
CAD
mesh point
input line
region
mesh line
exterior region
interior region
region table
