Faster point set pattern matching in 3-D

DOI10.1016/S0167-8655(98)00101-9MaRDI QIDQ4226539zbMATH OpenOpenAlexFDO

Authors Laurence Boxer

Publication date 27 April 1999

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(98)00101-9

zbMATH Keywords

point set pattern matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Recommendations

• Point set pattern matching in 3-D
• Combinatorial Pattern Matching
• Point set pattern matching in \(d\)-dimensions

Cited in

(3)

• Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
• Point set pattern matching in 3-D
• Ant colony optimization based binary search for efficient point pattern matching in images

This page was built for publication: Faster point set pattern matching in 3-D

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