Geometric Matching
Geometric Matching is a combinatorial optimization problem in geometric graph theory that seeks a pairing of vertices from a given set of points in Euclidean space such that the induced edges satisfy specific geometric constraints, typically minimizing or maximizing a function of the distances or angles between matched points.
274
Publications
16.4K
Citations
678
Authors
324
Institutions
Publications per year
2017–2026
50
Variants
Geometric Matching Problem
Parents
274
Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text
Siamese Instance Search for Tracking
Ran Tao, Efstratios Gavves, A.W.M. Smeulders · 2016 · 1.2K citations · Full text
Corey Goldfeder, Matei Ciocarlie, Hao Dang et al. · 2009 · 312 citations
1–5 of 274
678
6
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 678
324

Tel Aviv University
Tel Aviv, Israel
14 h-index
15 publications
1.2K citations
Freie Universität Berlin
Berlin, Germany
7 h-index
13 publications
907 citations

Johns Hopkins University
Baltimore, United States
7 h-index
12 publications
595 citations
Ben-Gurion University of the Negev
Beersheba, Israel
7 h-index
10 publications
480 citations
University of Michigan
Ann Arbor, United States
6 h-index
7 publications
608 citations

Czech Technical University in Prague
Prague, Czechia
6 h-index
9 publications
890 citations

Carleton University
Ottawa, Canada
6 h-index
13 publications
294 citations
Stanford University
Stanford, United States
6 h-index
17 publications
610 citations
1–8 of 324
TPAMI · 13 publications · 981 citations
12
h-index
7 publications · 251 citations
7
h-index
7 publications · 214 citations
7
h-index
Repository · 6 publications · 236 citations
6
h-index
6 publications · 193 citations
6
h-index
1–5