Faster bottleneck non-crossing matchings of points in convex position

DOI10.1016/j.comgeo.2017.05.002zbMath1377.65028arXiv1602.04922OpenAlexW2963350965MaRDI QIDQ2401333

Miloš Stojaković, Marko Savić

Publication date: 8 September 2017

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

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

zbMATH Keywords

complexityalgorithmmatchingsconvex positionbottlenecknon-crossingmonochromatic points

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items (3)

New variants of perfect non-crossing matchings ⋮ New variants of perfect non-crossing matchings ⋮ Structural properties of bichromatic non-crossing matchings

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal algorithm for the Euclidean bottleneck full Steiner tree problem
• Bottleneck non-crossing matching in the plane
• Non-crossing matchings of points with geometric objects
• Approximating the bottleneck plane perfect matching of a point set
• Compatible geometric matchings
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• Computing Euclidean bottleneck matchings in higher dimensions
• A Bottleneck Matching Problem with Edge-Crossing Constraints
• Non-crossing Connectors in the Plane
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Faster bottleneck non-crossing matchings of points in convex position