Combinatorial geometry problems in pattern recognition

DOI10.1007/S00454-002-2884-3MaRDI QIDQ1864112zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(13)

• Output sensitive algorithms for approximate incidences and their applications
• Geometric pattern matching reduces to \(k\)-SUM
• Output sensitive algorithms for approximate incidences and their applications
• Maximal pattern complexity, dual system and pattern recognition
• A note on maximally repeated sub-patterns of a point set
• Improved bounds for incidences between points and circles
• Homotheties and incidences
• scientific article; zbMATH DE number 939815 (Why is no real title available?)
• Pattern Recognition on Oriented Matroids
• Geometric Pattern Matching Reduces to k-SUM.
• On the number of similar instances of a pattern in a finite set
• On the maximum number of translates in a point set
• Checking oriented matroid isomorphism by means of canonical labeling

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

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