Bottleneck matching in the plane

DOI10.1016/j.comgeo.2023.101986zbMath1524.68410arXiv2205.05887OpenAlexW4320487361MaRDI QIDQ6103175

Micha Sharir, Matthew J. Katz

Publication date: 26 June 2023

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.05887

zbMATH Keywords

geometric optimizationmatrix multiplicationunit disk graphbottleneck matchingorder-k Voronoi diagram

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Bottleneck non-crossing matching in the plane
• Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
• Unit disk graphs
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• Selecting distances in the plane
• Powers of tensors and fast matrix multiplication
• Algorithms for two bottleneck optimization problems
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams

This page was built for publication: Bottleneck matching in the plane