论文信息 - Faster bottleneck non-crossing matchings of points in convex position

Faster bottleneck non-crossing matchings of points in convex position

Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position, we present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algorithm of cubic time complexity.

Miloš Stojaković | Marko Savić

[1] Chuan Yi Tang,et al. Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs , 1992, Discret. Appl. Math..

[2] David R. Wood,et al. Edge-Removal and Non-Crossing Configurations in Geometric Graphs , 2010, Discret. Math. Theor. Comput. Sci..

[3] Matthew J. Katz,et al. Bottleneck non-crossing matching in the plane , 2014, Comput. Geom..

[4] Paz Carmi,et al. Approximating the bottleneck plane perfect matching of a point set , 2013, Comput. Geom..

[5] Jan Kratochvíl,et al. Non-crossing Connectors in the Plane , 2012, TAMC.

[6] Alon Itai,et al. Geometry Helps in Bottleneck Matching and Related Problems , 2001, Algorithmica.

[7] Jean Cardinal,et al. Non-crossing matchings of points with geometric objects , 2013, Comput. Geom..

[8] Matthew J. Katz,et al. Computing Euclidean bottleneck matchings in higher dimensions , 2000, Inf. Process. Lett..

[9] Noga Alon,et al. Long non-crossing configurations in the plane , 1993, SCG '93.

[10] Sergey Bereg,et al. Compatible geometric matchings , 2009, Comput. Geom..

[11] Saladi Rahul,et al. A Bottleneck Matching Problem with Edge-Crossing Constraints , 2015, Int. J. Comput. Geom. Appl..

[12] Michiel H. M. Smid,et al. Bottleneck Bichromatic Plane Matching of Points , 2014, CCCG.

[13] Joseph S. B. Mitchell,et al. Matching regions in the plane using non-crossing segments , 2015 .