43_vertices = nodeShape.GetVerticesAsVectors();

62for (i = 0; (i + 1) < _vertices.Length; i += 2) 64_shapeBounds.Union(new Rect((Point)_vertices[i], (Point)_vertices[i + 1])); 66if (i < _vertices.Length) 68_shapeBounds.Union((Point)_vertices[i]); 95for (int i = 0; i < _vertices.Length; i++) 97pointBuffer.Add(node.Position + _vertices[i]); 102for (int i = 0; i < _vertices.Length; i++) 104pointBuffer.Add(node.Position + (_vertices[i] * pressureFactor)); 123Point vertex = node.Position + (_vertices[_vertices.Length - 1] * node.PressureFactor); 124for (int i = 0; i < _vertices.Length; i++) 126Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 135for (int i = 0, count = _vertices.Length; i < count; i++) 137Point vertex = node.Position + (_vertices[i] * node.PressureFactor); 143Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 204int count = _vertices.Length; 208Vector connection = spine + _vertices[i] * pressureDelta; 223HitResult goingTo = WhereIsVectorAboutVector(connection, _vertices[(i + 1) % count] - _vertices[i]); 230HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 234quad.A = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 235quad.B = endNode.Position + _vertices[i] * endNode.PressureFactor; 249HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 253quad.C = endNode.Position + _vertices[i] * endNode.PressureFactor; 254quad.D = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 321return HitTestPolygonSegment(_vertices, hitBegin, hitEnd); 351int i = 0, count = _vertices.Length; 355vertex = _vertices[i] * pressureFactor; 376count = _vertices.Length; 379i = (i + 1) % _vertices.Length; 380Vector nextVertex = (pressureFactor == 1) ? _vertices[i] : (_vertices[i] * pressureFactor); 410count = _vertices.Length; 411while (((endNode.Position + _vertices[i] * pressureFactor) != quad.B) && (count != 0)) 413i = (i + 1) % _vertices.Length; 482if (true == HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 690Vector lastVertex = _vertices[_vertices.Length - 1]; 700for (int k = 0, count = _vertices.Length; k < count || (k == count && testNextEdge); k++) 702Vector vertex = _vertices[k % count]; 912return _vertices; 962if (true == HitTestPolygonCircle(_vertices, hitCenter, hitRadius)) 987if (true == HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 1074int i = 0, count = _vertices.Length; 1078vertex = _vertices[i] * pressureFactor; 1089count = _vertices.Length; 1100i = (i + 1) % _vertices.Length; 1101Vector nextVertex = _vertices[i] * pressureFactor; 1140count = _vertices.Length; 1141while (!DoubleUtil.AreClose((endNode.Position + _vertices[i] * pressureFactor), quad.B) && (count != 0)) 1143i = (i + 1) % _vertices.Length; 1225? HitTestPolygonCircle(_vertices, hitBegin, hitEnd) 1226: HitTestPolygonSegment(_vertices, hitBegin, hitEnd))