[ < ] [ > ] [ << ] [ Up ] [ >> ] [Top] [Contents] [Index] [ ? ]

### Intersection and Convex Hull of polyhedra

All functions described in this paragraph are functional.

#### Strict version

These functions return polyhedra in minimal form and their parameters are minimized when it is not already the case.

Function: poly_t* poly_intersection (const poly_t* pa, const poly_t* pb)
Return the intersection of the two polyhedra. The function choose one of the polyhedron as starting point, and adds to it the constraints of the other one. One chooses the polyhedron that have the greatest number of equalities, or else the greatest number of constraints.
Function: poly_t* poly_intersection_array (const poly_t* const* po, int size)
Return the intersection of the (non-empty) array of polyhedra po of size size. The function chooses one of the polyhedron as starting point, and adds to it the constraints of all the other ones. One choose the polyhedron that have the greatest number of equalities, or else the greatest number of constraints.
Function: poly_t* poly_add_constraints (const poly_t* po, matrix_t* mat)
Return the intersection of the polyhedron with the set of constraints given by the matrix. The matrix may be sorted by the function.
Function: poly_t* poly_add_constraint (const poly_t* po, const pkint_t* tab)
Return the intersection of the polyhedron with the constraint given by tab.
Function: poly_t* poly_convex_hull (const poly_t* pa, const poly_t* pb)
Return the convex hulls of the two polyhedra. The function choose one of the polyhedron as starting point, and adds to it the generators of the other one. One chooses the polyhedron that have the greatest number of lines, or else the greatest number of generators.
Function: poly_t* poly_convex_hull_array (const poly_t* const* po, int size)
Return the convex hull of the (non-empty) array of polyhedra po of size size. The function choose one of the polyhedron as starting point, and adds to it the generators of all the other ones. One chooses the polyhedron that have the greatest number of lines, or else the greatest number of generators.
Function: poly_t* poly_add_frames (const poly_t* po, matrix_t* mat)
Return the convex hull of the polyhedron and the set of generators given by the matrix. The matrix may be sorted by the function.
Function: poly_t* poly_add_frame (const poly_t* po, const pkint_t* tab)
Return the convex hull of the polyhedron and the generator given by tab.

#### Lazy version

These functions are the lazy version of the preceding ones. They return polyhedra in non minimal form and their parameters are minimized only if it is necessary.

Function: poly_t* poly_intersection_lazy (const poly_t* pa, const poly_t* pb)
Function: poly_t* poly_intersection_array_lazy (const poly_t* const* po, int size)
Function: poly_t* poly_add_constraints_lazy (const poly_t* po, matrix_t* mat)
Function: poly_t* poly_add_constraint_lazy (const poly_t* po, const pkint_t* tab)
Function: poly_t* poly_convex_hull_lazy (const poly_t* pa, const poly_t* pb)
Function: poly_t* poly_convex_hull_array_lazy (const poly_t* const* po, int size)
Function: poly_t* poly_add_frames_lazy (const poly_t* po, matrix_t* mat)
Function: poly_t* poly_add_frame_lazy (const poly_t* po, const pkint_t* tab)

 [ < ] [ > ] [ << ] [ Up ] [ >> ] [Top] [Contents] [Index] [ ? ]

This document was generated on October, 27 2006 using texi2html