Home | History | Annotate | Download | only in optimize

Lines Matching full:bbox

64     final BoundingBox bbox;
71 public Octnode(BoundingBox bbox, ArrayList<OCTTriangle> tris){
72 this.bbox = bbox;
77 float extent = bbox.getXExtent() * 0.5f;
78 Vector3f center = new Vector3f(bbox.getCenter().x + extent * extentMult[side].x,
79 bbox.getCenter().y + extent * extentMult[side].y,
80 bbox.getCenter().z + extent * extentMult[side].z);
84 private float getAdditionCost(BoundingBox bbox, OCTTriangle t){
85 if (bbox.intersects(t.get1(), t.get2(), t.get3())){
86 float d1 = bbox.distanceToEdge(t.get1());
87 float d2 = bbox.distanceToEdge(t.get2());
88 float d3 = bbox.distanceToEdge(t.get3());
94 private void expandBoxToContainTri(BoundingBox bbox, OCTTriangle t){
95 Vector3f min = bbox.getMin(null);
96 Vector3f max = bbox.getMax(null);
100 bbox.setMinMax(min, max);
103 private boolean contains(BoundingBox bbox, OCTTriangle t){
104 if (bbox.contains(t.get1()) &&
105 bbox.contains(t.get2()) &&
106 bbox.contains(t.get3())){
113 if (tris == null || depth > 50 || bbox.getVolume() < 0.01f || tris.size() < minTrisPerNode){
226 bbox.setCheckPlane(0);
228 Camera.FrustumIntersect result = cam.contains(bbox);
269 BoundingBox bbox2 = new BoundingBox(bbox);
270 bbox.transform(transform, bbox2);
311 if (child.bbox.intersects(r)){