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

DOI10.1007/BF01928920MaRDI QIDQ3790652zbMATH OpenOpenAlexFDO

Authors 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

treessortingworst-case complexitysearchingparallel 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)

Recommendations

• Efficient parallel convex hull algorithms
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• A sublogarithmic convex hull algorithm
• The Ultimate Planar Convex Hull Algorithm?
• Finding the convex hull of a sorted point set in parallel

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 44565 (Why is no real title available?)
• On the identification of the convex hull of a finite set of points in the plane
• On the number of relational operators necessary to compute certain functions of real variables
• Two remarks on a convex hull algorithm

Cited in

(3)

• An optimal algorithm with unknown time complexity for convex matrix searching
• Constructing sets of functions which have a givenF-cardinality
• On paths in search or decision trees which require almost worst-case time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3790652)