首页> 外文会议>Annual symposium on Computational geometry;symposium on Computational geometry >A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

【24h】

A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)

机译：一种用于计算中等障碍中有界曲率的最短路径的多项式时间算法（扩展摘要）

获取原文

页面导航

著录项
引文网络
相似文献
相关主题

著录项

来源
《Annual symposium on Computational geometry;symposium on Computational geometry》|1996年|P.242-251|共10页
会议地点 Philadelphia PA(US);Philadelphia PA(US)
作者
Jean-Daniel Boissonnat; Sylvain Lazard;
展开▼
作者单位

INRIA BP 93 06902 Sophia Antipolis Cedex France;

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles [J] . Jean-Daniel Boissonnat, Sylvain Lazard International journal of computational geometry & applications . 2003,第3期

机译：多项式时间算法，用于计算中等障碍物中有界曲率的最短路径
2. Shortest path amidst disc obstacles is computable [J] . Chang EC, Choi SW, Kwon DY, International journal of computational geometry & applications . 2006,第5a6期

机译：盘片障碍中的最短路径是可计算的
3. Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width [J] . Lars Jaffke, O-joung Kwon, Jan Arne Telle LIPIcs : Leibniz International Proceedings in Informatics . 2018,第30期

机译：最长诱导路径的多项式算法和涉及界限MIM宽度图中的诱导不相交路径问题
4. A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract) [C] . Christian S. Mata, Joseph S. B. Mitchell, PJoseph S. B. Mitchell Annual symposium on Computational geometry;Symposium on Computational geometry . 1997

机译：一种用于计算加权平面细分中最短路径的新算法（扩展摘要）
5. The bounded linear calculus: A characterization of the class of polynomial-time computable functions based on bounded linear logic [D] . Pitt, Francois 1994

机译：有界线性演算：基于有界线性逻辑的多项式时间可计算函数的表征
6. Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model [O] . Haitao Wei, Shusheng Zhang, Xiaohui He 2021

机译：基于单向道路网络模型的动态禁区最短路径算法
7. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles [O] . Boissonnat, Jean-Daniel, Lazard, Sylvain 2003

机译：多项式时间算法，用于计算中等障碍物中有界曲率的最短路径

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

客服微信
服务号