Combinatorial geometry problems in pattern recognition

DOI10.1007/s00454-002-2884-3zbMath1011.68117OpenAlexW2106538419MaRDI QIDQ1864112

Peter Brass

Publication date: 17 March 2003

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-2884-3

zbMATH Keywords

combinatorial geometrypoint pattern matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (11)

Output sensitive algorithms for approximate incidences and their applications ⋮ On the maximum number of translates in a point set ⋮ Geometric pattern matching reduces to \(k\)-SUM ⋮ Checking oriented matroid isomorphism by means of canonical labeling ⋮ Improved Bounds for Incidences Between Points and Circles ⋮ On the number of similar instances of a pattern in a finite set ⋮ Geometric Pattern Matching Reduces to k-SUM. ⋮ Homotheties and incidences ⋮ Maximal pattern complexity, dual system and pattern recognition ⋮ A note on maximally repeated sub-patterns of a point set ⋮ Unnamed Item

This page was built for publication: Combinatorial geometry problems in pattern recognition