Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space

DOI10.1016/J.IPL.2007.09.003zbMATH Open1184.68206OpenAlexW1969819350MaRDI QIDQ2380079FDOQ2380079

Authors: Dror Aiger, Klara Kedem 

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.09.003

Recommendations

• Scalable parallel algorithms for geometric pattern recognition
• Geometric pattern matching for point sets in the plane under similarity transformations
• Fast computing of three-dimensional convex hulls using graphics hardware
• Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
• Faster point set pattern matching in 3-D

zbMATH Keywords

algorithmsrandomized algorithmsapproximation algorithmsgeometric pattern matching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• On Sets of Distances of n Points
• The upper envelope of Voronoi surfaces and its applications
• Lines, line-point incidences and crossing families in dense sets
• Streaming geometric optimization using graphics hardware
• Combinatorial and experimental methods for approximate point pattern matching
• Title not available (Why is that?)
• Getting around a lower bound for the minimum Hausdorff distance

Cited In (2)

• Title not available (Why is that?)
• Vertex–transformation streams

This page was built for publication: Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380079)