Hannukainen, A., Korotov, S., & Křížek, M. (2014). On numerical regularity of the face-to-face longest-edge bisection algorithm for tetrahedral partitions. Science of computer programming, 90, 34-41. https://doi.org/10.1016/j.scico.2013.05.002
Citace podle Chicago (17th ed.)Hannukainen, Antti, Sergey Korotov, a Michal Křížek. "On Numerical Regularity of the Face-to-face Longest-edge Bisection Algorithm for Tetrahedral Partitions." Science of Computer Programming 90 (2014): 34-41. https://doi.org/10.1016/j.scico.2013.05.002.
Citace podle MLA (9th ed.)Hannukainen, Antti, et al. "On Numerical Regularity of the Face-to-face Longest-edge Bisection Algorithm for Tetrahedral Partitions." Science of Computer Programming, vol. 90, 2014, pp. 34-41, https://doi.org/10.1016/j.scico.2013.05.002.