Faster bottleneck non-crossing matchings of points in convex position

Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке: https://open.uns.ac.rs/handle/123456789/2907

Назив:	Faster bottleneck non-crossing matchings of points in convex position
Аутори:	Savić, Mirko Stojaković, Mila
Датум издавања:	1-окт-2017
Часопис:	Computational Geometry: Theory and Applications
Сажетак:	© 2017 Elsevier B.V. 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.
URI:	https://open.uns.ac.rs/handle/123456789/2907
ISSN:	09257721
DOI:	10.1016/j.comgeo.2017.05.002
Налази се у колекцијама:	FTN Publikacije/Publications