On the public citation graph

Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points

https://doi.org/10.1007/bf02770866
0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01198169openalex-snapshot
Random convex hulls in a product of balls
inferredcites →https://doi.org/10.1007/bf01587088openalex-snapshot
A randomized algorithm for fixed-dimensional linear programming
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02237955openalex-snapshot
A note on linear expected time algorithms for finding convex hulls
inferredcites →https://doi.org/10.1007/bf02280782openalex-snapshot
Moment inequalities for random variables in computational geometry
inferredcites →https://doi.org/10.1007/bf02293050openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1007/bfb0101638openalex-snapshot
Zufällige Polyeder - Eine Obersicht
inferredcites →https://doi.org/10.1016/0020-0190(72)90045-2openalex-snapshot
An efficient algorith for determining the convex hull of a finite planar set
inferredcites →https://doi.org/10.1016/0020-0190(78)90003-0openalex-snapshot
A fast convex hull algorithm
inferredcites →https://doi.org/10.1016/0020-0190(78)90051-0openalex-snapshot
Divide and conquer for linear expected time
inferredcites →https://doi.org/10.1016/0020-0190(86)90037-2openalex-snapshot
Linear programming in O(n × 3d) time
inferredcites →https://doi.org/10.1016/0166-218x(91)90064-4openalex-snapshot
Convex hulls of samples from spherically symmetric distributions
inferredcites →https://doi.org/10.1016/0196-6774(85)90017-3openalex-snapshot
Finding the convex hull facet by facet
inferredcites →https://doi.org/10.1016/0377-2217(89)90361-5openalex-snapshot
The simplex method - a probabilistic analysis
inferredcites →https://doi.org/10.1016/0898-1221(81)90059-6openalex-snapshot
How to reduce the average complexity of convex hull finding algorithms
inferredcites →https://doi.org/10.1090/dimacs/004/07openalex-snapshot
Computing the convex hull in the Euclidean plane in linear expected time
inferredcites →https://doi.org/10.1137/0213003openalex-snapshot
Linear Time Algorithms for Two- and Three-Variable Linear Programs
inferredcites →https://doi.org/10.1145/109648.109659openalex-snapshot
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
inferredcites →https://doi.org/10.1145/12130.12172openalex-snapshot
Constructing higher-dimensional convex hulls at logarithmic cost per face
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/321556.321564openalex-snapshot
An Algorithm for Convex Polytopes
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.2307/3214033openalex-snapshot
The convex hull of a uniform sample from the interior of a simple d-polytope
inferredcites →https://doi.org/10.2307/3214289openalex-snapshot
On the convex hull of random points in a polytope
inferredcites →https://doi.org/10.7146/math.scand.a-10655openalex-snapshot
A Problem in Geometric Probability.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.21059openalex-snapshot
Doubly random polytopes
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_399openalex-snapshot
Probabilistic Analysis of Simplex Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_525openalex-snapshot
Probabilistic Analysis of Simplex Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_525-1openalex-snapshot
Probabilistic Analysis of Simplex Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-59051-1_1openalex-snapshot
Probability Models for Convex Clusters
inferred← citeshttps://doi.org/10.1007/s00454-006-1257-8openalex-snapshot
Average-Case Analysis of the Double Description Method and the Beneath-Beyond Algorithm
inferred← citeshttps://doi.org/10.1007/s13399-020-00845-4openalex-snapshot
Multi-objective optimization of biomass diffusers for solving operational problems
inferred← citeshttps://doi.org/10.1007/s186-1999-8373-5openalex-snapshot
A lower bound on the average number of Pivot-steps for solving linear programs Valid for all variants of the Simplex-Algorithm
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2025.100992openalex-snapshot
Polyhedral control design: Theory and methods
inferred← citeshttps://doi.org/10.1016/j.enconman.2016.08.076openalex-snapshot
Bioethanol and power from integrated second generation biomass: A Monte Carlo simulation
inferred← citeshttps://doi.org/10.1109/amc58169.2024.10505640openalex-snapshot
A Speed-Up Method of Calculating Grasp Quality Measure for Optimal Grasp by a Robot Hand
inferred← citeshttps://doi.org/10.1142/s179383092350091xopenalex-snapshot
A simple and efficient preprocessing step for convex hull problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.