Section 2 describes the approach for the construction of enclosing and enclosed ellopsoids of convex polyhedra.
Alternatively, ' 'paper bag' ' icons can mark the position of polyhedra, revealing their size but not their shape.
For simulations, the links of redundant robots are modeled by a union of line segments or convex polyhedra.
Consequently, how to accurately model convex polyhedra is very important for efficient minimum separating distance computation and collision detection.
This section introduces polyhedra and studies the problem of how many tetrahedra are needed to mesh them.
Two-dimensional polygons and threedimensional polyhedra (curved or linear) are widely recognized examples of solids.
In fact the problem of calculating the closure of the convex hull of two polyhedra is also exponential even for bounded polyhedra (polytopes).
According to the different intersection situations, we can understand the emergency about the current status of those dynamic polyhedra.
