首页 | 本学科首页   官方微博 | 高级检索  
     


On the complexity of computing the Hausdorff distance
Authors:Ker-I Ko
Affiliation:Department of Computer Science, Stony Brook University, Stony Brook, NY 11794, USA;Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia
Abstract:
Keywords:Hausdorff distance  Computational complexity  Polynomial-time  Two-dimensional plane  Curves  Turing machine
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号