首页> 外文期刊>Journal of Computer and System Sciences >Transforming Curves on Surfaces*
【24h】

Transforming Curves on Surfaces*

机译:变换曲面上的曲线*

获取原文
获取原文并翻译 | 示例
       

摘要

We describe an optimal algorithm to decide if one closed curve on a tri- angulated 2-manifold can be continuously transformed to another, i.e., if they are homotopic. Suppose C_1 and C_2 are two closed curves on a surface M of genus g. Further, suppose T is a triangulation of M of size n such that C_1 and C_2 are represented as edge--vertex sequences of lengths k_1 and k_2 in T, respec- tively. Then, our algorithm decides if C_1 and C_2 are homotopic in O(n + k_1 + k_2) time and space, provided g ≠ 2 if M is orientable, and g ≠ 3, 4 if M is nonorientable. This implies as well an optimal algorithm to decide if a closed curve on a surface can be continuously contracted to a point. Except for three low genus cases, our algorithm completes an investigation into the computational complexity of two classical problems for surfaces posed by the mathematician Max Dehn at the beginning of this century. The novelty of our approach is in the application of methods from modern combinatorial group theory.
机译:我们描述了一种最佳算法,用于确定三角2分流形上的一条闭合曲线是否可以连续变换为另一条闭合曲线,即它们是否是同位的。假设C_1和C_2是属g的曲面M上的两条闭合曲线。此外,假设T是大小为n的M的三角剖分,使得C_1和C_2分别表示为T中长度为k_1和k_2的边-顶点序列。然后,我们的算法将确定C_1和C_2是否在O(n + k_1 + k_2)的时间和空间上是同构的,如果M是可定向的,则g≠2,如果M是不可定向的,则g≠3,4。这也意味着确定曲面上的闭合曲线是否可以连续收缩到一个点的最佳算法。除三个低类情况外,我们的算法完成了对本世纪初数学家Max Dehn提出的曲面的两个经典问题的计算复杂度的研究。我们方法的新颖之处在于应用了现代组合群论中的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号