-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBox.java
More file actions
134 lines (115 loc) · 4.06 KB
/
Copy pathBox.java
File metadata and controls
134 lines (115 loc) · 4.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
/*
* The MIT License
*
* Copyright 2023 akava.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package ptjava;
class Box {
public Vector Min;
public Vector Max;
Box() {
}
Box(Vector min, Vector max) {
Min = min;
Max = max;
}
static Box BoxForShapes(IShape[] shapes) {
if (shapes.length == 0) {
return new Box();
}
Box box = shapes[0].BoundingBox();
for (IShape shape : shapes) {
box = box.Extend(shape.BoundingBox());
}
return box;
}
static Box BoxForTriangles(Triangle[] shapes) {
if (shapes.length == 0) {
return new Box();
}
Box box = shapes[0].BoundingBox();
for (Triangle shape : shapes) {
box = box.Extend(shape.BoundingBox());
}
return box;
}
public Vector Anchor(Vector anchor) {
return Min.Add(Size().Mul(anchor));
}
public Vector Center() {
return Anchor(new Vector(0.5, 0.5, 0.5));
}
public double OuterRadius() {
return Min.Sub(Center()).Length();
}
public double InnerRadius() {
return Center().Sub(Min).MaxComponent();
}
public Vector Size() {
return Max.Sub(Min);
}
public Box Extend(Box b) {
return new Box(Min.Min(b.Min), Max.Max(b.Max));
}
public boolean Contains(Vector b) {
return Min.getX() <= b.getX() && Max.getX()>= b.getX() &&
Min.getY() <= b.getY() && Max.getY() >= b.getY() &&
Min.getZ() <= b.getZ() && Max.getZ() >= b.getZ();
}
public boolean Intersects(Box b) {
return !(Min.getX() > b.Max.getX()
|| Max.getX() < b.Min.getX()
|| Min.getY() > b.Max.getY()
|| Max.getY() < b.Min.getY()
|| Min.getZ() > b.Max.getZ()
|| Max.getZ() < b.Min.getZ());
}
public double[] Intersect(Ray r) {
Vector t1 = Min.Sub(r.Origin).Div(r.Direction);
Vector t2 = Max.Sub(r.Origin).Div(r.Direction);
Vector tmin = t1.Min(t2);
Vector tmax = t1.Max(t2);
double tNear = Math.max(Math.max(tmin.getX(), tmin.getY()), tmin.getZ());
double tFar = Math.min(Math.min(tmax.getX(), tmax.getY()), tmax.getZ());
return new double[]{tNear, tFar};
}
public boolean[] Partition(Axis axis, double point) {
boolean left = false;
boolean right = false;
switch (axis) {
case AxisX:
left = Min.getX() <= point;
right = Max.getX() >= point;
break;
case AxisY:
left = Min.getY() <= point;
right = Max.getY() >= point;
break;
case AxisZ:
left = Min.getZ() <= point;
right = Max.getZ() >= point;
break;
case AxisNone:
break;
}
return new boolean[]{left, right};
}
}