2) horizon modeling with arbitrary boundaries
任意边域地层建模
3) arbitrary boundary
任意边界
1.
Aiming at a limitation that the FASS (space filling, self avoiding, simple and self similar) curve, fractal laser scanning path can only fill in a square region, which is a method presented to realize the trimming of FASS fractal curve in arbitrary boundary layer by means of judging the intersection points between parameterized arbitrary boundary and a FASS fractal curve.
针对FASS分形扫描路径只能填充正方形区域的限制 ,提出通过判别参数化表示的任意边界与FASS曲线的交点来实现任意边界薄层FASS分形曲线的裁剪 。
4) arbitrary domain
任意域
1.
In this paper, the node-based local mesh generation algorithm is extended so that it can be applied to the 2D arbitrary domain.
将该基于节点的局部网格生成算法的适用范围拓展到二维任意域。
2.
The concept of Delaunay tetrahedralization in an arbitrary domain(DTETAD) is presented based on the definition of local optimized triangulation which is brought out to substitute the strict.
为了将Delaunay四面体化更广泛地应用于网络剖分,通过引入局部优化三角形面代替Deluany严格的空球准则,提出了3维任意域内点集Deluanay四面体化(DTETAD)的概念,并首先通过若干关键定理的证明,研究了一个四面体划分是DETEAD的充要条件,然后建立了DTETAD的空球准则。
5) arbitrary area
任意区域
1.
It is possible to fulfil the scan transformation of boundary for arbitrary area possrssingseveral iinnerloops.
本文对包围任意区域的边界自由曲线采用较灵活的数据结构，能利用区域连贯性、扫描线连贯性和边的连贯性，实现了包括任意多个内环的任意区域的边界扫描转换。
6) general polygon
任意多边形
1.
An optimal triangulation algorithm for general polygon based on edge prior;
基于边优先的任意多边形最优三角剖分
2.
The application of general clipping algorithm occurs frequently in geographical information systems(GIS),which is designed usually as general polygon clipping against single general or rectangle polygon.
从提高任意多边形裁剪效能的要求出发,提出以矩形网格来裁剪任意多边形的思想,该算法省去传统裁剪方式中一些重复运算步骤和数据访问、直线求交的工作量,同时也考虑了节省内存的需求,裁剪性能比传统的逐一单元格裁剪方式有所提高。
补充资料：任意
1.任随其意，不受约束。 2.没有任何条件的。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条