Computing Homotopic Shortest Paths Efficiently
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-45749-6_38
Reference16 articles.
1. R. Bar-Yehuda and B. Chazelle. Triangulating disjoint Jordan chains. International Journal of Computational Geometry & Applications, 4(4):475–481, 1994.
2. S. Cabello, Y. Liu, A. Mantler, and J. Snoeyink. Testing homotopy for paths in the plane. In 18th Annual Symposium on Computational Geometry, pages 160–169, 2002.
3. B. Chazelle. A theorem on polygon cutting with applications. In 23rd Annual Symposium on Foundations of Computer Science, pages 339–349, 1982.
4. B. Chazelle. An algorithm for segment-dragging and its implementation. Algorithmica, 3:205–221, 1988.
5. R. Cole and A. Siegel. River routing every which way, but loose. In 25th Annual Symposium on Foundations of Computer Science, pages 65–73, 1984.
Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-crossing Connectors in the Plane;Lecture Notes in Computer Science;2013
2. Optimal Paths for Mutually Visible Agents;Algorithms and Computation;2005
3. Encoding Homotopy of Paths in the Plane;LATIN 2004: Theoretical Informatics;2004
4. Pointed Binary Encompassing Trees;Algorithm Theory - SWAT 2004;2004
5. Computing homotopic shortest paths in the plane;Journal of Algorithms;2003-11
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3