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

Authors

678

  1. SV
    Suresh Venkatasubramanian

    University of Utah, United States

    6 publications · 188 citations

    6

    h-index

  2. PI
    Piotr Indyk

    Massachusetts Institute of Technology, United States

    6 publications · 188 citations

    6

    h-index

  3. KK
    Klara Kedem

    Ben-Gurion University of the Negev, Israel

    5 publications · 239 citations

    5

    h-index

  4. AE
    Alon Efrat

    University of Arizona, United States

    5 publications · 306 citations

    5

    h-index

  5. JR
    J. Ross Beveridge

    Colorado State University, United States

    5 publications · 209 citations

    5

    h-index

1–5 of 678

Venues

  1. 12

    h-index

  2. Computational Geometry

    7 publications · 251 citations

    7

    h-index

  3. Theoretical Computer Science

    7 publications · 214 citations

    7

    h-index

  4. arXiv (Cornell University)

    Repository · 6 publications · 236 citations

    6

    h-index

  5. Pattern Recognition Letters

    6 publications · 193 citations

    6

    h-index

1–5