Graphics Reference
In-Depth Information
P
0
c
v
0
H
1
v
2
H
2
v
1
v
3
v
4
H
4
H
3
H
6
H
5
v
5
v
6
Figure 9.9
At top left, the six halfspaces from Figure 9.7. Remaining illustrations show
Seidel's algorithm applied to these six halfspaces. The feasible region is shown in light gray
and the current halfspace is shown in thick black. Arrows indicate the 1D constraints in the
recursive call.
9.4.2
Quadratic Programming
Although linear programming is effective for determining if two polyhedra are inter-
secting, no other particular information is returned when the two polyhedra are not
intersecting. In some cases it is desirable to have the closest points between the two
polyhedra be returned, effectively giving the distance between the polyhedra. It turns
