| 1. | Discrete boolean operation based on triangular patch
基于三角面片的离散化布尔运算 |
| 2. | Robust polyhedral boolean set operations achieved by triangle - based representations
统一于三角面片的可靠多面体布尔集合运算 |
| 3. | Secondly , the triangle meshing of contour loops that includes triangle plane filling between layers and section triangle plotting was accomplished
其次,边界轮廓环的三角网格化:层间三角面片填充和端面三角划分。 |
| 4. | It is natural to extend this algorithm to 3d triangular mesh and output the texture coordinates for each triangle vertex
该算法可以自然扩展到三维三角网格，以三角面片作为合成单元，合成后直接输出每个顶点的纹理坐标。 |
| 5. | For the purpose of constructing the topology relation among triangles in stl files rapidly , the algorithm of reconstructing topological relation is presented
摘要为快速构建stl文件三角面片之间的拓扑关系，提出了一种快速拓扑重构算法。 |
| 6. | The running speed and efficiency of slices software plays an important role in rapid prototype , a new algorithm is presented based on grouping array in this paper
本文在现有切片算法的基础上，提出了基于分组的切片算法，该算法使三角面片排序的运算量小，建立拓扑关系便捷。 |
| 7. | Computer aided geometric design , 1989 , 6 : 323 - 358 . 7 seidel h p . symmetric recursive algorithms for surfaces : b - patches and the de boor algorithm for polynomials over triangles
2三角b样条曲面的曲率分布具有“节点线”现象，也就是说在其曲率在三角面片的边界上有“聚集”现象。 |
| 8. | But the triangle mesh data measured is massive , and usually up to millions even ten millions of triangular patches , and this occupies too much storage and hd space of computer
然而测量得到的三角网格数据是海量的,经常达到百万甚至上千万个三角面片,大量占用计算机的内存及硬盘资源。 |
| 9. | As to simple concave polygons or complicated planar polygons with holes , they must be decomposed to the collection of triangular facets or arbitrary convex polygons to satisfy the requirement of succeeding graphic operations
对于简单凹多边形或有内孔的复杂平面多边形，需要将它们剖分成三角面片的集合或任意凸多边形的集合。 |
| 10. | By using asp 、 ado and sql technology . 4 ) studied the stl file form and defects , established the topologic information among point 、 line and facet , designed a algorithm for repairing the stl file defects
4 )深入分析了stl文件的结构以及其三角面片具有的固有缺陷,设计了stl模型文件的的拓扑结构,提出了缺陷检查和修补程序算法。 |
