| 1. | Is a bitwise or of all vertex clip codes and
是所有顶点剪辑代码的按位or ，而 |
| 2. | Is a bitwise and of all vertex clip codes
是所有顶点剪辑代码的按位and 。 |
| 3. | The algorithm for the quickest path problem
所有顶点对之间最快路的算法 |
| 4. | Of all vertex clip codes , and
则对所有顶点剪辑代码按位执行 |
| 5. | All vertices are clipped by the top plane of the viewing frustum
所有顶点都被视图截锥的顶平面所剪裁。 |
| 6. | All vertices are clipped by the left plane of the viewing frustum
所有顶点都被视图截锥的左平面所剪裁。 |
| 7. | All vertices are clipped by the back plane of the viewing frustum
所有顶点都被视图截锥的后平面所剪辑。 |
| 8. | All vertices are clipped by the right plane of the viewing frustum
所有顶点都被视图截锥的右平面所剪裁。 |
| 9. | All vertices are clipped by the front plane of the viewing frustum
所有顶点都被视图截锥的前平面所剪辑。 |
| 10. | All vertices are clipped by the bottom plane of the viewing frustum
所有顶点都被视图截锥的底平面所剪裁。 |
