Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/2907| Nаziv: | Faster bottleneck non-crossing matchings of points in convex position | Аutоri: | Savić, Mirko Stojaković, Mila |
Dаtum izdаvаnjа: | 1-окт-2017 | Čаsоpis: | Computational Geometry: Theory and Applications | Sažetak: | © 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 |
| Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.