當前位置: 首頁>>代碼示例>>C#>>正文


C# DTSweepContext.LocateNode方法代碼示例

本文整理匯總了C#中Poly2Tri.DTSweepContext.LocateNode方法的典型用法代碼示例。如果您正苦於以下問題:C# DTSweepContext.LocateNode方法的具體用法?C# DTSweepContext.LocateNode怎麽用?C# DTSweepContext.LocateNode使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在Poly2Tri.DTSweepContext的用法示例。


在下文中一共展示了DTSweepContext.LocateNode方法的2個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的C#代碼示例。

示例1: PointEvent

		/// <summary>
		/// Find closes node to the left of the new point and
		/// create a new triangle. If needed new holes and basins
		/// will be filled to.
		/// </summary>
		private static AdvancingFrontNode PointEvent(DTSweepContext tcx, TriangulationPoint point)
		{
			AdvancingFrontNode node, newNode;

			node = tcx.LocateNode(point);
			if (tcx.IsDebugEnabled) tcx.DTDebugContext.ActiveNode = node;
			newNode = NewFrontTriangle(tcx, point, node);

			// Only need to check +epsilon since point never have smaller
			// x value than node due to how we fetch nodes from the front
			if (point.X <= node.Point.X + TriangulationUtil.EPSILON) Fill(tcx, node);

			tcx.AddNode(newNode);

			FillAdvancingFront(tcx, newNode);
			return newNode;
		}
開發者ID:Altaxo,項目名稱:Altaxo,代碼行數:22,代碼來源:DTSweep.cs

示例2: PointEvent

        /// <summary>
        /// Find closes node to the left of the new point and
        /// create a new triangle. If needed new holes and basins
        /// will be filled to.
        /// </summary>
        private static AdvancingFrontNode PointEvent(DTSweepContext tcx, TriangulationPoint point)
        {
            AdvancingFrontNode node, newNode;

            node = tcx.LocateNode (point);
            if (tcx.IsDebugEnabled) {
                tcx.DTDebugContext.ActiveNode = node;
            }
            if (node == null || point == null) {
                return null;
            }
            newNode = NewFrontTriangle (tcx, point, node);

            // Only need to check +epsilon since point never have smaller
            // x value than node due to how we fetch nodes from the front
            if (point.X <= node.Point.X) { // + Point2D.PRECISION) { // TODO: Changed by Kronnect Games MathUtil.EPSILON) {
                Fill (tcx, node);
            }

            tcx.AddNode (newNode);

            FillAdvancingFront (tcx, newNode);
            return newNode;
        }
開發者ID:TPSAncient,項目名稱:TurnBasedStrategyUnity,代碼行數:29,代碼來源:DTSweep.cs


注:本文中的Poly2Tri.DTSweepContext.LocateNode方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。