Link Distance and Shortest Path Problems in the Plane-Reference-Cited by-同舟云学术

Link Distance and Shortest Path Problems in the Plane

Published:2009 Issue: Volume: Page:140-151
ISSN:0302-9743
Container-title:Algorithmic Aspects in Information and Management
language:
Short-container-title:

Author:

Cook Atlas F.,Wenk Carola

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02158-9_13

Reference17 articles.

1. Agarwal, P.K., Sharir, M.: Davenport–Schinzel Sequences and Their Geometric Applications. In: Handbook of Computational Geometry, pp. 1–47. Elsevier, Amsterdam (2000)

2. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry and Applications 5, 75–91 (1995)

3. Arkin, E.M., Mitchell, J.S.B., Suri, S.: Optimal link path queries in a simple polygon. In: 3rd Symposium on Discrete Algorithms (SODA), pp. 269–279 (1992)

4. Chiang, Y., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: 10th Symposium on Discrete Algorithms (SODA), pp. 215–224 (1999)

5. Cook IV, A.F., Wenk, C.: Geodesic Fréchet distance inside a simple polygon. In: 25th Symposium on Theoretical Aspects of Computer Science (STACS) (2008)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Link distance and shortest path problems in the plane;Computational Geometry;2011-10

2. On Minimum Link Monotone Path Problems;Journal of Computing and Information Science in Engineering;2011-08-01

3. Visiting a Sequence of Points with a Bevel-Tip Needle;LATIN 2010: Theoretical Informatics;2010