Abstract
We describe and analyze the first adaptive algorithm for merging k convex hulls in the plane. This merging algorithm in turn yields a synergistic algorithm to compute the convex hull of a set of planar points, taking advantage both of the positions of the points and their order in the input. This synergistic algorithm asymptotically outperforms all previous solutions for computing the convex hull in the plane.
Author supplied keywords
Cite
CITATION STYLE
Barbay, J., & Ochoa, C. (2018). Synergistic solutions for merging and computing planar convex hulls. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10976 LNCS, pp. 156–167). Springer Verlag. https://doi.org/10.1007/978-3-319-94776-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
