Hillar, C. J., &; Martin del Campo Sanchez, A. (2013). Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/j.jsc.2012.06.006 

Edelsbrunner, H., Preparata, F., &; West, D. (1990). Tetrahedrizing point sets in three dimensions. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(08)80068-5 

Edelsbrunner, H., &; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(86)80020-7 

Chazelle, B., &; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/S0747-7171(85)80028-6