In 3D mechanical packaging and CAD collision detection:
Two components are bounded by **3D Axis-Aligned Bounding Boxes (AABB)**.
Each AABB is defined by its minimum corner `[min_x, min_y, min_z]` and maximum corner `[max_x, max_y, max_z]`.
Write a function that returns `true` if the two bounding boxes overlap in 3D space, or `false` if they are separated.
Boxes are considered colliding if they overlap along all three Cartesian axes $X, Y, Z$:
$$\text{overlap} = (\min A_x \le \max B_x \land \max A_x \ge \min B_x) \land (\min A_y \le \max B_y \land \max A_y \ge \min B_y) \land (\min A_z \le \max B_z \land \max A_z \ge \min B_z)$$
### Input Format
- Line 1 contains six floats: `minAx minAy minAz maxAx maxAy maxAz`.
- Line 2 contains six floats: `minBx minBy minBz maxBx maxBy maxBz`.
### Output Format
- Print `true` or `false`.
### Constraints
- `min_x <= max_x`, `min_y <= max_y`, `min_z <= max_z` for both boxes.
Sample Cases
Example 1Sample Case
Input: 0 0 0 2 2 2
1 1 1 3 3 3
Output: true
Example 2Sample Case
Input: 0 0 0 1 1 1
2 2 2 3 3 3
Output: false
Example 3Sample Case
Input: 0 0 0 2 2 2
0 0 0 2 2 2
Output: true
Example 4Sample Case
Input: 0 0 0 1 1 1
0 0 0 1 1 1
Output: true
Constraints
Runtime Limit: 2000 ms per test batch
Memory Limit: 256 MB
Standard I/O stream reading
Official submissions are evaluated against hidden test cases on the server to verify time & memory complexity.