42_vertices = nodeShape.GetVerticesAsVectors();

61for (i = 0; (i + 1) < _vertices.Length; i += 2) 63_shapeBounds.Union(new Rect((Point)_vertices[i], (Point)_vertices[i + 1])); 65if (i < _vertices.Length) 67_shapeBounds.Union((Point)_vertices[i]); 94for (int i = 0; i < _vertices.Length; i++) 96pointBuffer.Add(node.Position + _vertices[i]); 101for (int i = 0; i < _vertices.Length; i++) 103pointBuffer.Add(node.Position + (_vertices[i] * pressureFactor)); 122Point vertex = node.Position + (_vertices[_vertices.Length - 1] * node.PressureFactor); 123for (int i = 0; i < _vertices.Length; i++) 125Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 134for (int i = 0, count = _vertices.Length; i < count; i++) 136Point vertex = node.Position + (_vertices[i] * node.PressureFactor); 142Point nextVertex = node.Position + (_vertices[i] * node.PressureFactor); 203int count = _vertices.Length; 207Vector connection = spine + _vertices[i] * pressureDelta; 222HitResult goingTo = WhereIsVectorAboutVector(connection, _vertices[(i + 1) % count] - _vertices[i]); 229HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 233quad.A = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 234quad.B = endNode.Position + _vertices[i] * endNode.PressureFactor; 248HitResult comingFrom = WhereIsVectorAboutVector(_vertices[i] - _vertices[j], connection); 252quad.C = endNode.Position + _vertices[i] * endNode.PressureFactor; 253quad.D = beginNode.Position + _vertices[i] * beginNode.PressureFactor; 320return HitTestPolygonSegment(_vertices, hitBegin, hitEnd); 350int i = 0, count = _vertices.Length; 354vertex = _vertices[i] * pressureFactor; 375count = _vertices.Length; 378i = (i + 1) % _vertices.Length; 379Vector nextVertex = (pressureFactor == 1) ? _vertices[i] : (_vertices[i] * pressureFactor); 409count = _vertices.Length; 410while (((endNode.Position + _vertices[i] * pressureFactor) != quad.B) && (count != 0)) 412i = (i + 1) % _vertices.Length; 481if (HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 689Vector lastVertex = _vertices[_vertices.Length - 1]; 699for (int k = 0, count = _vertices.Length; k < count || (k == count && testNextEdge); k++) 701Vector vertex = _vertices[k % count]; 911return _vertices; 961if (HitTestPolygonCircle(_vertices, hitCenter, hitRadius)) 986if (HitTestPolygonSegment(_vertices, hitBegin, hitEnd)) 1073int i = 0, count = _vertices.Length; 1077vertex = _vertices[i] * pressureFactor; 1088count = _vertices.Length; 1099i = (i + 1) % _vertices.Length; 1100Vector nextVertex = _vertices[i] * pressureFactor; 1139count = _vertices.Length; 1140while (!DoubleUtil.AreClose((endNode.Position + _vertices[i] * pressureFactor), quad.B) && (count != 0)) 1142i = (i + 1) % _vertices.Length; 1224? HitTestPolygonCircle(_vertices, hitBegin, hitEnd) 1225: HitTestPolygonSegment(_vertices, hitBegin, hitEnd))