Geometric Pattern Matching Reduces to k-SUM

We prove that some exact geometric pattern matching problems reduce in linear time to k -SUM when the pattern has a fixed size  k . This holds in the real RAM model for searching for a similar copy of a set of k ≥ 3 points within a set of n points in the plane, and for searching for an affine image...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete & computational geometry 2022-10, Vol.68 (3), p.850-859
Hauptverfasser:	Aronov, Boris, Cardinal, Jean
Format:	Artikel
Sprache:	eng
Schlagworte:	Algebra Algorithms Combinatorics Computational Mathematics and Numerical Analysis Decision trees Geometry Graphs Mathematics Mathematics and Statistics Pattern matching Searching
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!