On the complexity of convex hull algorithms if rotational minima can be found very fast

DOI10.1007/BF01928920zbMath0646.68060OpenAlexW2070697312MaRDI QIDQ3790652

Ulrich Huckenbeck

Publication date: 1988

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01928920

zbMATH Keywords

sortingtreessearchingworst-case complexityparallel processortime functionsplanar convex hull problemparallel networksgift-wrapping algorithmJarvis marchrotational minima

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

Constructing sets of functions which have a givenF-cardinality ⋮ On paths in search or decision trees which require almost worst-case time

Cites Work

• On the number of relational operators necessary to compute certain functions of real variables
• Two remarks on a convex hull algorithm
• On the identification of the convex hull of a finite set of points in the plane
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of convex hull algorithms if rotational minima can be found very fast