Schreiber, Y. (2010). An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra. Discrete & computational geometry, 43(1), 21-53. https://doi.org/10.1007/s00454-009-9136-8
Chicago-Zitierstil (17. Ausg.)Schreiber, Yevgeny. "An Optimal-Time Algorithm for Shortest Paths On Realistic Polyhedra." Discrete & Computational Geometry 43, no. 1 (2010): 21-53. https://doi.org/10.1007/s00454-009-9136-8.
MLA-Zitierstil (9. Ausg.)Schreiber, Yevgeny. "An Optimal-Time Algorithm for Shortest Paths On Realistic Polyhedra." Discrete & Computational Geometry, vol. 43, no. 1, 2010, pp. 21-53, https://doi.org/10.1007/s00454-009-9136-8.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.