平面极大值与凸包的协同计算
Synergistic Computation of Planar Maxima and Convex Hull
摘要:
对固定输入大小的实例的最坏情况复杂度的细化考虑输入顺序或输入结构,但很少同时考虑两者。Barbay et al. [2016]描述了多重集上的“协同”解决方案,它利用了输入顺序和输入结构,例如渐近优于任何只利用其中一个特征的可比解决方案。我们认为他们的结果的\textsc{Maxima Set}和\textsc{Convex Hull}的一组平面点的计算的扩展。在回顾和改进以前的方法只利用输入顺序或输入结构,我们描述了协同解决方案,最佳利用各种概念的输入顺序和输入结构的平面。作为中间结果,我们描述和分析的第一个自适应算法\textsc{Merging Maxima}和\textsc{Merging Convex Hulls}。
英文摘要:
Refinements of the worst case complexity over instances of fixed input size consider the input order or the input structure, but rarely both at the same time. Barbay et al. [2016] described ``synergistic'' solutions on multisets, which take advantage of the input order and the input structure, such as to asymptotically outperform any comparable solution which takes advantage only of one of those features. We consider the extension of their results to the computation of the \textsc{Maxima Set} and the \textsc{Convex Hull} of a set of planar points. After revisiting and improving previous approaches taking advantage only of the input order or of the input structure, we describe synergistic solutions taking optimally advantage of various notions of the input order and input structure in the plane. As intermediate results, we describe and analyze the first adaptive algorithms for \textsc{Merging Maxima} and \textsc{Merging Convex Hulls}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。