Bottleneck partial-matching Voronoi diagrams and applications
DOI10.1016/j.comgeo.2015.10.001zbMath1334.65051OpenAlexW2253120257MaRDI QIDQ902422
Rafel Jaume, Matthias Schymura
Publication date: 18 January 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.10.001
algorithmbipartite graphbottleneck matchingpartial point matching under translationsVoronoi-type diagram
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- The power of geometric duality
- Topologically sweeping an arrangement
- Lexicographic bottleneck problems
- An improved general procedure for lexicographic bottleneck problems
- Lexicographic bottleneck combinatorial problems
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Congruence, similarity, and symmetries of geometric objects
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
- Bottleneck Partial-Matching Voronoi Diagrams and Applications
- TWO THEOREMS IN GRAPH THEORY
- Assignment Problems
- Algorithms for two bottleneck optimization problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Geometry helps in bottleneck matching and related problems
This page was built for publication: Bottleneck partial-matching Voronoi diagrams and applications
