Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/2907
DC FieldValueLanguage
dc.contributor.authorSavić, Mirkoen
dc.contributor.authorStojaković, Milaen
dc.date.accessioned2019-09-23T10:24:31Z-
dc.date.available2019-09-23T10:24:31Z-
dc.date.issued2017-10-01en
dc.identifier.issn09257721en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/2907-
dc.description.abstract© 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.en
dc.relation.ispartofComputational Geometry: Theory and Applicationsen
dc.titleFaster bottleneck non-crossing matchings of points in convex positionen
dc.typeJournal/Magazine Articleen
dc.identifier.doi10.1016/j.comgeo.2017.05.002en
dc.identifier.scopus2-s2.0-85019101929en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85019101929en
dc.relation.lastpage34en
dc.relation.firstpage27en
dc.relation.volume65en
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

SCOPUSTM   
Citations

2
checked on Jul 8, 2023

Page view(s)

2
Last Week
1
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.