Efficient Algorithms to Detect Null-Homologous Cycles on 2-Manifolds
-
Published:1997-06
Issue:03
Volume:07
Page:167-174
-
ISSN:0218-1959
-
Container-title:International Journal of Computational Geometry & Applications
-
language:en
-
Short-container-title:Int. J. Comput. Geom. Appl.
Affiliation:
1. Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur, West Bengal 721302 , India
Abstract
Given a cycle of length k on a triangulated 2-manifold, we determine if it is null-homologous (bounds a surface) in O(n+k) optimal time and space where n is the size of the triangulation. Further, with a preprocessing step of O(n) time we answer the same query for any cycle of length k in O(g+k) time, g the genus of the 2-manifold. This is optimal for k < g.
Publisher
World Scientific Pub Co Pte Lt
Subject
Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. HOMEOMORPHISM OF 2-COMPLEXES IS EQUIVALENT TO GRAPH ISOMORPHISM;International Journal of Computational Geometry & Applications;2000-10