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


Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
Authors:Dror Aiger  Klara Kedem
Affiliation:a Department of Computer Science, Ben Gurion University, Be'er Sheva, Israel
b Orbotech LTD, Yavne, Israel
Abstract:We present a GPU-based approach to geometric pattern matching. We reduce this problem to finding the depth (maximally covered point) of an arrangement of polytopes in transformation space and describe hardware assisted (GPU) algorithms which exploit the available set of graphics operations to perform a fast rasterized depth computation. We give two alternatives, one is for translation + scale and the other is for rigid transformations, both have 3-parameters transformation space. We give extensive experimental results showing the running time of our method and its dependence on various parameters.
Keywords:Algorithms   Approximation algorithms   Randomized algorithms   Geometric pattern matching
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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