Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/2907
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Savić, Mirko | en |
dc.contributor.author | Stojaković, Mila | en |
dc.date.accessioned | 2019-09-23T10:24:31Z | - |
dc.date.available | 2019-09-23T10:24:31Z | - |
dc.date.issued | 2017-10-01 | en |
dc.identifier.issn | 09257721 | en |
dc.identifier.uri | https://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.ispartof | Computational Geometry: Theory and Applications | en |
dc.title | Faster bottleneck non-crossing matchings of points in convex position | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.doi | 10.1016/j.comgeo.2017.05.002 | en |
dc.identifier.scopus | 2-s2.0-85019101929 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85019101929 | en |
dc.relation.lastpage | 34 | en |
dc.relation.firstpage | 27 | en |
dc.relation.volume | 65 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | FTN Publikacije/Publications |
SCOPUSTM
Citations
2
checked on Jul 8, 2023
Page view(s)
2
Last Week
1
1
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.