private List<Point2d> calsHookPoints(List<Point2d> points, Integer numOfTrees) { double area = Math.abs(Triangulate.area(points)); if (numOfTrees == null) { // 1 tree on 100 square meters numOfTrees = (int) Math.round(area / 100d); } if (numOfTrees > 1000) { // XXX numOfTrees = 1000; } PolygonList2d polygon = new PolygonList2d(points); return monteCarloHookGenerator(polygon, numOfTrees); }
private static boolean isWallCounterClockwise(Wall wall) { PolygonList2d wallToPolygon = BuildingUtil.wallToOuterPolygon(wall); if (0.0f < Triangulate.area(wallToPolygon.getPoints())) { return true; } return false; }
if (0.0f < area(contour)) { for (int v = 0; v < n; v++) { V[v] = v;
if (0.0f < area(contour)) { for (int v = 0; v < n; v++) { V[v] = v;