Lines Matching defs:umbraLength
556 int umbraLength = polyLength;
562 dumpPolygon(umbra, umbraLength, "umbra");
571 Vector2 finalUmbra[umbraLength];
573 int finalUmbraLength = hull(umbra, umbraLength, finalUmbra);
677 const Vector2* umbra, int umbraLength, Vector2* newPenumbra, int& newPenumbraIndex,
682 umbra, umbraLength);
692 for (int j = 1; j < umbraLength; j++) {
693 int newUmbraIndex = (previousClosestUmbraIndex + j) % umbraLength;
738 int skippedUmbraIndex = (previousClosestUmbraIndex + k + 1) % umbraLength;
761 int skippedUmbraIndex = (previousClosestUmbraIndex + k + 1) % umbraLength;
836 Vector2* penumbra, int penumbraLength, Vector2* umbra, int umbraLength,
881 // The total pair number can be as high as umbraLength + penumbraLength.
882 const int maxNewPenumbraLength = umbraLength + penumbraLength;
893 genNewPenumbraAndPairWithUmbra(penumbra, penumbraLength, umbra, umbraLength, newPenumbra,
898 for (int i = 0; i < umbraLength; i++) {
910 // one has umbraLength, the last one has at most umbraLength.
912 // For the size of index buffer, the umbra area needs (2 * umbraLength + 2).
916 const int totalVertexCount = newPenumbraLength + umbraLength * 2;
917 const int totalIndexCount = 2 * umbraLength + 2 * verticesPairIndex + 6;
934 for (int i = 0; i < umbraLength; i++) {
966 for (int i = 0; i < umbraLength; i++) {
984 for (int i = 0; i < umbraLength; i++) {