Geometric Pattern Matching: A Performance Study

In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignment and combinatorial pattern matching. We present analytical and empirical evaluations of these schemes. Our results indicate that aproper implementation ofan alignmentbased method outperforms other often asymptotically better approaches.

• Type: Conference
• Year: 1999
• Where: COMPGEOM
• Authors: Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
• Keywords: Combinatorial Pattern Matching, COMPGEOM 1999, Discrete Geometry, Geometric Pattern Matching, Pattern Matching