星形排列算法

List<NetunitModel> children = parent.getChildren();
// 1、设置圆心
Point center = new Point(310, 250);
// 2、设置半径
int radius = 160 + children.size() * 3;
// 3、得到平分角
double deltaAngle = 2 * Math.PI / (children.size() - 1); // count是元素个数(不包含网元)
// 4、得到每一个元素的坐标
for (int i = 0; i < children.size(); ++i) {
int x = (int) (center.x - 10 + Math.sin(deltaAngle * i) * radius);
int y = (int) (center.y - 10 - Math.cos(deltaAngle * i) * radius);
// count++;//计数器元素个数(不包含网元)
if ("1".equals(children.get(i).getType()))
children.get(i).setConstraint(new Rectangle(270, 230, -1, -1));
else
children.get(i).setConstraint(new Rectangle(x, y, -1, -1));
}