point in polygon 中文意思是什麼

point in polygon 解釋
多邊形內的點
  • point : n 1 尖頭，尖端；尖頭器具；〈美國〉筆尖；接種針，雕刻針，編織針；小岬，小地角；【拳擊】下巴。2 【...
  • in : adv 1 朝里，向內，在內。 A coat with a furry side in有皮裡子的外衣。 Come in please 請進來。 The ...
  • polygon : n. 【幾】多邊形，多角形。 a regular polygon 正多邊形。adj. -lygonal 多邊多角形的（地面龜裂）。
  1. Abstract : in this paper ， a ray - optics analysis is performed to investigate the asymmetry of dual beam scanning field produced by a rotating polygon. some basic equations of dual beam scan are derived ， such as ， the position vector for the incident point ， the scalar expression for reflected ray ， scan pattern on observation plane ect. the far - field asymmetry of the scanning field has been discussed

    文摘:應用幾何光學理論研究了多光束轉鏡掃描場的非對稱性，導出多光束掃描入射點位置矢量、反射線標量表達式、觀察面上的掃描軌跡方程，並研究了掃描遠場的非對稱性。
  2. In addition, if the last point and the first point do not coincide, they specify the closing side of the polygon

    另外，如果最後一個點和第一個點不重合，則這兩個點指定多邊形的閉合邊。
  3. Grid hiding and break line cut are difficult point in displaying of 3 - d grid data, the thesis also presented a new visualizing algorithm applicable for 3 - d grid data of topography - sliced polygon filling. the experiment result shown, contrasting to floating level, this algorithm excels in both time complication and effect of grid hiding and break line cut

    三維網格顯示中的網格消隱與斷線處理一直是網格可視化技術中的難點，本文結合三維地形網格的特點，提出了一種新的網格可視化演算法? ?切片多邊形區域填充法，在實驗結果對比中，無論是演算法復雜度還是顯示效果上都明顯優于浮動水平面法。
  4. In order to obtain the image of absolute point, we design two kinds of planar model. and they are equilateral - polygon planar model and planar model that containing more than two circles

    為了從圖像中獲得圓環點的圖像，我們設計出二類不同的平面模板：正多邊形平面模板和包含二條以上圓曲線的平面模板。
  5. In proc. graphics interface 2004, london, ontario, canada, may 17 - 19, 2004, pp. 247 - 254. 12 chen b, nguyen m x. pop : a hybrid point and polygon rendering system for large data

    一是將空間劃分成許多區域，為每個區域記錄：當視點位於該區域時，各層結點中離該區域最近的結點在隊列中的位置。
  6. 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

    對不規則件的多邊形近似表示、多邊形凸、凹點、多邊形方向、多邊形面積和多邊形單排、對排、雙排以及聯排的預先處理進行了探討。
  7. And its spatial analytic functions such as overlay analysis and buffer analysis that can be used to extract multiple variables and information from geologic bodies organized in map layers in point, line or polygon shape are in favor of discovering ore - forming factors, summarizing regional metallogenic regularities and constructing geologic metallogenic models

    以矢量數據結構為主，實現了對點、線、面地質體的gis空間分析功能，以便對多元矢量數據信息進行疊加分析和相關分析，發現和歸納研究區域的成礦規律，建立成礦地質模型。
  8. This paper also analyzed some key problems in 3d triangulation from scattered points. new determining principles for the relationship of point and line in space and for convexo - concave vertices of space polygon is discussed which corrected the previous method and can be applied in space triangle mesh. at the end of this papar, the future research areaes of triangluation from 3d scattered points are demonstrated

    本文還分析了三維空間直接三角剖分所要解決的一些關鍵問題，進而提出了空間中點與直線位置關系判別的新方法及空間多邊形頂點凹凸性判別的新方法，修正了以往演算法在應用上的局限性，使之能夠適用於復雜網格多邊形邊界。
  9. Many functions such as field information map, contrastive map of yearly yield, prescription map, etc. can be made. in order to improve using accuracy of agricultural gps, by analyzing the error of point, polyline, polygon, several methods are produced such as arithmetic average value, least squares, adding control points, etc. their principles, features and limitations are also analyzed and discussed. the mathematic model of average error method included in adding control points is established

    為了進一步提高農用gps的使用精度，研究了提高精度的方法，通過對點、線、面等誤差的分析，提出了應用算術平均值法、最小二乘法、加入控制點法等多種提高精度的方法，分析和討論了它們的原理、特點與應用局限性，並建立了加入控制點法中的誤差平差法的數學模型。
  10. On the basis of the geochemistry digital model arithmetic of triangulated irregular network, i change the arithmetic of auto - tracing isoline. in process of auto - tracing isoline, the proplem of tracing - crossand and mini - heave was resolved. the isoline is smoothec by linear overlap algorithm. in addtion, the model can build other unit of map such as extramum point, polygon

    在不規則三角網數字模型的基礎上，改進並實現了等值線生成演算法，解決了等值線生成中的分叉問題，解決了等值線上的小凸起問題；對等值線採用線性迭代演算法進行了圓滑處理；提出延伸三角網演算法，用於實現了開等值線的閉合；生成用於地學分析的區域圖元，等值線圖元，極值點圖元等。
  11. In this paper, i will present some algorithms of polyhedral visual hull reconstruction : ( 1 ) polyhedral v isual h ull generation a igorithm b ased one dge - pool - searching, which constrains the 3 - d intersections into the 2 - d planes intersection via the epipolar theory to reduce the complexity a nd c an r educe t he t imes f or c ones t o b e p rejected o nto t he i mage p lanes, i n which we induced the index list to every points on the surface of object, and connected the related points to get sub polygons on surface and in turn get the mesh model, we replace triangulation process of disordered points cloud by edge - pool searching. ; ( 2 ) reconstruction based on degenerated - polygon - intersection, which have the following improvements on traditional bull intersection : using degenerated polygon to orga nize intersected area on cone face, which may be discontinuous ; a fast intersection algorithm of polygons on the cone face based on degenerated polygons, which is consistent between the continuous polygons and the discontinuous ones. the intersection of degenerated polygons is similar to the convergence of two ordered lists, which is comparably simple to the bull operation ; ( 3 ) reconstruction algorithm based on ray - tracing, in which all the rays that run through the vertex on silhouette of object will intersect with all the cones correspondent to other silhouette, and we have to calculate the intersection of all such line segments, the endpoints of which are considered to lie on the surface of object and we will get the point cloud on the surface of object

    同時利用共極線原理把三維計算投影到二維平面以降低求交計算的復雜度，該演算法可以減少光錐向圖像平面投影計算的次數，以邊池搜索取代散亂點集上進行的三角剖分； （ 2 ）基於退化多邊形求交的多面體可見殼模型重構，系統引入退化多邊形的概念，把錐體平面的交集中不連通的部分用一個退化多邊形來表示，並引入了新的基於退化多邊形的求交演算法，與傳統多面體可見殼重構相比，該演算法有以下幾點創新：在圖像平面以退化多邊形組織投影錐體和物體輪廓的交集，把任意錐面與物體輪廓的交集歸一到一個退化多邊形；基於退化多邊形的二維平面上多邊形快速相交演算法，該演算法在一定程度上就是兩個有序鏈表的合併，大大簡化了先前的布爾求交計算； （ 3 ）基於光線跟蹤的演算法，該演算法中所有通過輪廓頂點的光線和對應其它圖像輪廓的光錐進行求交計算，最後得到每次求交計算得到線段的交集，該線段的頂點就認為是物體表面點，從而得到物體表面的點雲。
  12. A simple example is given to support the theory. object - oriented technique is widely used in gis data modeling. point - object class, line - object class, time class, polygon - object class and complex - object class are extracted from geo - objects, which combines with spatio - temporal topology forms an object - oriented gis spatio - temporal data model

    運用面向對象的分析技術，對gis中點、線、面基本對象類和復雜對象類的分析與描述，結合時空拓撲的描述，總結出了一個面向對象的gis時空數據模型，體現了面向對象理論在gis時空數據建模中的思想。
  13. In addition, if the last point and the first of the array point do not coincide, they specify the last side of the polygon

    另外，如果數組的最後一個點和第一個點不重合，則這兩個點指定多邊形的最後一條邊。
  14. In [ 6 ] andras bezdek proved that if a convex n - gon and n points are given, then the points and the sides of the polygon can be renumbered so that at least [ n / 3 ] triangles spanned by the ith point and the ith side ( i = 1, 2, … n ) are mutually non - overlapping

    …久; }為任一給定平面點集，幾存在八中的點和尹約邊的一個匹配，使得由abst丑act相匹配的點和邊所形成的三角形中至少有二/ 21個三角形是互不交疊的
  15. If the first point in the array is not the same as the last point, those two points are connected to close the polygon

    如果數組中的第一個點與最後一個點不是同一點，則將連接這兩個點以閉合多邊形。
分享友人
分享到 Line

分享到臉書