private static void organize(Petal[] opts) {
		int l = 1, p = 0, i = 0;
		int lr = -1;
		for (i = 0; i < opts.length; i++) {
			if (lr == -1) {
				// lr = (int)(ph / (1 - Math.cos((2 * PI) / (ppl * l))));
				lr = 75 + (50 * (l - 1));
			}
			opts[i].ta = (PI / 2) - (p * (2 * PI / (l * ppl)));
			opts[i].tr = lr;
			if (++p >= (ppl * l)) {
				l++;
				p = 0;
				lr = -1;
			}
		}
	}