.png){kind=icon}
返回
Faster point set pattern matching in 3-D
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-8655(98)00101-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We improve upon the best previous upper bound for the volume of output for the Point Set Pattern Matching Problem (PSPM) in Euclidean 3-space, R-3. This in turn yields a better running time than was previously known for a sequential algorithm to solve this problem. The previous best sequential running time for PSPM in R-3 is O(kn(5/2)[lambda(6) (n)/n](1/4) log n) time, where k is the size of the pattern and n is the size of the sample set. In the current paper, we show that a sequential algorithm can solve PSPM in R-3 in O(kn(2)[lambda(6)(n)/n](1/2) log n) time. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
point set pattern matching
congruence
analysis of algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
.png){kind=icon}
