Fast Matching Algorithms for Points on a Polygon
From MaRDI portal
Publication:3978776
DOI10.1137/0220026zbMath0743.68133OpenAlexW2138356285MaRDI QIDQ3978776
Publication date: 25 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220026
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (max. 100)
New variants of perfect non-crossing matchings ⋮ Efficient many-to-Many point matching in one dimension ⋮ A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem ⋮ Perspectives of Monge properties in optimization ⋮ New variants of perfect non-crossing matchings ⋮ A generalized hypergreedy algorithm for weighted perfect matching ⋮ Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs ⋮ An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon ⋮ Minimum cost \(b\)-matching problems with neighborhoods
This page was built for publication: Fast Matching Algorithms for Points on a Polygon
