Approximate minimum-weight matching with outliers under translation
From MaRDI portal
Publication:5091017
DOI10.4230/LIPICS.ISAAC.2018.26MaRDI QIDQ5091017FDOQ5091017
Authors: Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Allen Xiao, Pankaj K. Agarwal, Micha Sharir 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.10466
Recommendations
- Partial-matching RMS distance under translation: combinatorics and algorithms
- Approximate one-to-one point pattern matching
- Efficient algorithms for geometric partial matching
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Improved approximation bounds for planar point pattern matching
Cites Work
- Faster Scaling Algorithms for Network Problems
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- Minimum-cost flows in unit-capacity networks
- Title not available (Why is that?)
- Algorithms for the transportation problem in geometric settings
- Partial-matching RMS distance under translation: combinatorics and algorithms
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Geographic quorum system approximations
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Matching point sets with respect to the earth mover's distance
This page was built for publication: Approximate minimum-weight matching with outliers under translation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091017)
