Lines Matching refs:hull

105 \section{Simple Hull}\label{s:simple hull}
110 (rational) convex hull.  For integer sets, the obvious choice
111 would be the integer hull.
112 However, {\tt isl} currently does not support an integer hull operation
114 The convex hull operation is supported, but it is also fairly
117 Usually, it is not required to compute the exact integer hull,
118 and an overapproximation of this hull is sufficient.
119 The ``simple hull'' of a set is such an overapproximation
123 This means that the simple hull is relatively cheap to compute
124 and that the number of constraints in the simple hull is no
127 The {\em simple hull} of a set
381 the integer affine hull.  The algorithm used is the same as that
383 Computing the affine hull is fairly expensive, but it can
668 The affine hull of the recession cone therefore needs to be projected
679 To detect such cases, we compute the affine hull of the context
681 for computing this affine hull is that of \textcite{Karr1976affine},
684 the current approximation of the affine hull.
686 of the hull, while any extra points found during the construction
687 of the hull is added to this list.
1860 they are using the convex hull of $\domain R \cup \range R$
1861 or at least an approximation of this convex hull.
1862 We use the simple hull (\autoref{s:simple hull}) of $\domain R \cup \range R$.
2033 In our implementation we take as $D$ the simple hull
2034 (\autoref{s:simple hull}) of $\domain R \cup \range R$.