Cite
Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane.
MLA
Chen, Danny Z., and Haitao Wang. “Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane.” Algorithmica, vol. 81, no. 6, June 2019, pp. 2430–83. EBSCOhost, https://doi.org/10.1007/s00453-018-00540-x.
APA
Chen, D. Z., & Wang, H. (2019). Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica, 81(6), 2430–2483. https://doi.org/10.1007/s00453-018-00540-x
Chicago
Chen, Danny Z., and Haitao Wang. 2019. “Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane.” Algorithmica 81 (6): 2430–83. doi:10.1007/s00453-018-00540-x.