Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
4 Publications
2013 | Journal Article | IST-REx-ID: 5920
Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness Theorems and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.” Journal of Symbolic Computation, vol. 50, Elsevier, 2013, pp. 314–34, doi:10.1016/j.jsc.2012.06.006.
View
| Files available
| DOI
1990 | Journal Article | IST-REx-ID: 4060 | 
Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.
[Published Version]
View
| DOI
| Download Published Version (ext.)
1986 | Journal Article | IST-REx-ID: 4106
Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:10.1016/S0747-7171(86)80020-7.
View
| DOI
1985 | Journal Article | IST-REx-ID: 4120 |
Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
[Published Version]
View
| DOI
| Download Published Version (ext.)