多边形方向 meaning in English
orientation of polygon
Examples
- In this paper , the approximate polygon for irregular shapes , the protruding and concave point of polygon , the direction of polygon , the area of polygon , the single , face to face , frock , combinable packing are talked
对不规则件的多边形近似表示、多边形凸、凹点、多边形方向、多边形面积和多边形单排、对排、双排以及联排的预先处理进行了探讨。 - To fulfill the need of the application of rp technique in medical domain , reverse cad modeling from medical cross sections is systematically studied in this dissertation . firstly , some algorithms related to the research of this dissertation are studied . new algorithms for orientation and inclusion test for simple polygon , an error constrained automatic faring algorithm for b - spline curve and a theorem regarding the termination criterion for subdivision of triangular bezier patch are proposed
本文针对rp技术在医学领域应用的需要，系统研究了基于医学断层轮廓数据的反求cad建模理论和方法： ( 1 )在基础算法研究部分，提出了简单多边形方向及点在多边形内外判断的新方法、三角b zier曲面片离散的误差控制定理和一种带误差约束的b样条曲线的自动光顺方法； ( 2 )提出了一种基于相邻层轮廓相似性的医学断层轮廓数据曲面重构方法； ( 3 )提出了一种称为“虚拟测量”的曲面模型处理方法。 - ? to make the solid have realistic surface , we adopt advanced solid modeling method - constructive solid geometry . ? to free end - user from overwork , we presents and realizes many auto - processing algorithms , such as searching of inner - point , definition of polygon ' s counter - clockwise direction , as well as generation of numeric control codes . ? to checkout the collision and interference between cutter and part , we accomplish numeric control machining simulation , which can help end - user validate the correctness and rationality of numeric control codes , so it is needless that do repetitive test - cut before normal manufacture
正如将在后续章节中所讲述的那样，我们在系统中采用了许多先进的技术，其中主要包括以下几点：采用分层设计思想，使三维物体的设计得到了简化；采用先进的实体造型方法，使所建立的实体真实感强；实现了内点自动查找、多边形方向自动定义等算法，提高了系统的自动化水平；实现了刀具轨迹的自动生成、优化；实现了数控代码的自动编写，克服了手动编写的缺点；实现了数控加工仿真，能检验数控代码的正确性和合理性，并能自动检测刀具与工件之间的干涉。 - Cross section is a set of polygons and for this reason some relative algorithms for polygon are studied firstly . new algorithms for orientation and inclusion test for simple polygon are proposed . and ghosh ' s convex hull algorithms for simple polygon and convex polygons , subramanian ' s triangulation algorithm for arbitrary planar domain and o ' rourke ' s intersection algorithm for convex polygons are modified to make them more robust
断层轮廓为简单多边形，首先对多边形的一些相关算法进行了研究，提出了一种判断简单多边形方向及点在多边形内外的新方法，改进了subramanian的平面多连通域的三角划分方法、 ghosh的多边形的凸包及多个多边形的凸包算法和o ' rourke的凸多边形的求交算法。