diff options
| author | Sven Verdoolaege <skimo@kotnet.org> | 2009-04-13 23:11:19 +0200 |
|---|---|---|
| committer | Sven Verdoolaege <skimo@kotnet.org> | 2009-05-06 12:42:18 +0200 |
| commit | 6371ed7518d04dee5ccc1a3860bee122a3f1c6e0 (patch) | |
| tree | f8f1d14bba46837945d63051b947babc224a425d /test_inputs | |
| parent | b3acbdec6ee87a2c00278f47556b7de0653a7687 (diff) | |
| download | isl-6371ed7518d04dee5ccc1a3860bee122a3f1c6e0.tar.gz isl-6371ed7518d04dee5ccc1a3860bee122a3f1c6e0.tar.bz2 isl-6371ed7518d04dee5ccc1a3860bee122a3f1c6e0.zip | |
isl_map_convex_hull: handle unbounded, but pointed, case using wrapping
The case where the convex hull may be unbounded (but still pointed)
cannot be handled directly using wrapping. However, by changing
the homogeneous direction, we can in such cases always transform
the input polyhedra to polytopes, compute the hull and then transform back.
Since we already handle the case where the convex hull may not be
pointed, we can now handle all cases using wrapping.
The convex_hull_pair_elim function is therefore no longer used.
We leave it in, because we may want to allow the user to choose
in future which convex hull algorithm to use.
Diffstat (limited to 'test_inputs')
| -rw-r--r-- | test_inputs/convex14.polylib | 14 |
1 files changed, 14 insertions, 0 deletions
diff --git a/test_inputs/convex14.polylib b/test_inputs/convex14.polylib new file mode 100644 index 00000000..caaa8f5d --- /dev/null +++ b/test_inputs/convex14.polylib @@ -0,0 +1,14 @@ +3 4 +0 1 0 2 +1 0 1 0 +1 0 -1 2 + +3 4 +1 1 0 0 +1 0 1 0 +1 0 -1 2 + +3 4 +1 1 0 2 +1 0 1 0 +1 0 -1 2 |