Hillar, Christopher J., and Abraham Martin del Campo Sanchez. “Finiteness Theorems and Algorithms for Permutation Invariant Chains of Laurent Lattice Ideals.”10.1016/j.jsc.2012.06.006__Journal of Symbolic Computation, vol. 50, Elsevier, 2013, pp. 314–34, doi:10.1016/j.jsc.2012.06.006.

Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.”10.1016/S0747-7171(08)80068-5__Journal of Symbolic Computation, vol. 10, no. 3–4, Elsevier, 1990, pp. 335–47, doi:10.1016/S0747-7171(08)80068-5.

Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.”10.1016/S0747-7171(86)80020-7__Journal of Symbolic Computation, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:10.1016/S0747-7171(86)80020-7.

Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.”10.1016/S0747-7171(85)80028-6__Journal of Symbolic Computation, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.