Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D-Reference-Cited by-同舟云学术

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D

Published:2007-10-03 Issue:1-3 Volume:39 Page:17-37
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Agarwal Pankaj K.,Klein Rolf,Knauer Christian,Langerman Stefan,Morin Pat,Sharir Micha,Soss Michael

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-007-9019-9.pdf

Reference25 articles.

1. Contemporary Mathematics;P.K. Agarwal,1999

2. Agarwal, P.K., Klein, R., Knauer, C., Sharir, M.: Computing the detour of polygonal curves. Technical Report B 02-03, Freie Universität Berlin, Fachbereich Mathematik und Informatik (2002)

3. Agarwal, P.K., Sharir, M., Toledo, S.: Applications of parametric searching in geometric optimization. J. Algorithms 17, 292–318 (1994)

4. Aichholzer, O., Aurenhammer, F., Icking, C., Klein, R., Langetepe, E., Rote, G.: Generalized self-approaching curves. Discrete Appl. Math. 109, 3–24 (2001)

5. Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 121–153. Elsevier, Amsterdam (2000)

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

1. Bounded-Degree Plane Geometric Spanners in Practice;ACM Journal of Experimental Algorithmics;2023-04-08

2. Approximating the packedness of polygonal curves;Computational Geometry;2023-01

3. Weiterführende Ergebnisse;Algorithmische Geometrie;2022

4. On the Stretch Factor of Polygonal Chains;SIAM Journal on Discrete Mathematics;2021-01

5. Bottleneck detour tree of points on a path;Computational Geometry;2019-02