On the public citation graph
Randomized quickhull
0 signed · 46 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02187879openalex-snapshot
New applications of random sampling in computational geometry
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(73)90020-3openalex-snapshot
On the identification of the convex hull of a finite set of points in the plane
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)90021-2openalex-snapshot
Convex hull of a finite set of points in two dimensions
inferredcites →https://doi.org/10.1016/0020-0190(78)90042-xopenalex-snapshot
A more efficient 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(80)90125-8openalex-snapshot
Comments on a lower bound for convex hull determination
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.1093/comjnl/22.3.262openalex-snapshot
Constructing the convex hull of a set of points in the plane
inferredcites →https://doi.org/10.1137/0215021openalex-snapshot
The Ultimate Planar Convex Hull Algorithm?
inferredcites →https://doi.org/10.1137/0217052openalex-snapshot
A Randomized Algorithm for Closest-Point Queries
inferredcites →https://doi.org/10.1145/220279.220281openalex-snapshot
Output-sensitive results on convex hulls, extreme points, and related problems
inferredcites →https://doi.org/10.1145/322276.322289openalex-snapshot
A Lower Bound to Finding Convex Hulls
inferredcites →https://doi.org/10.1145/355759.355766openalex-snapshot
A New Convex Hull Algorithm for Planar Sets
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.5555/313651.313708openalex-snapshot
Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_43openalex-snapshot
In-Place Planar Convex Hull Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_44openalex-snapshot
Maximal and Convex Layers of Random Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_39openalex-snapshot
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
inferred← citeshttps://doi.org/10.1007/pl00009327openalex-snapshot
Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00454-003-2948-zopenalex-snapshot
Optimally Cutting a Surface into a Disk
inferred← citeshttps://doi.org/10.1007/s00454-004-1152-0openalex-snapshot
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
inferred← citeshttps://doi.org/10.1007/s10955-009-9905-zopenalex-snapshot
Random Convex Hulls and Extreme Value Statistics
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128931openalex-snapshot
Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.05.004openalex-snapshot
Space-efficient planar convex hull algorithms
inferred← citeshttps://doi.org/10.1088/1751-8113/44/41/415001openalex-snapshot
The convex hull for a random acceleration process in two dimensions
inferred← citeshttps://doi.org/10.1109/cisp.2009.5305692openalex-snapshot
A Parallel Dynamic Convex Hull Algorithm Based on the Macro to Micro Model
inferred← citeshttps://doi.org/10.1109/focs.2009.34openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1109/iccsit.2010.5563736openalex-snapshot
Notice of Retraction: A parallel dynamic convex hull algorithm based on the M2M model originated from thinking pattern of human beings
inferred← citeshttps://doi.org/10.1109/isaf.2009.5307621openalex-snapshot
Fast Flaw Contour Recognition algorithm in online Plate Ultrasonic Testing
inferred← citeshttps://doi.org/10.1142/s179383092350091xopenalex-snapshot
A simple and efficient preprocessing step for convex hull problem
inferred← citeshttps://doi.org/10.1145/1133255.1133993openalex-snapshot
An experimental analysis of self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1133981.1133993openalex-snapshot
An experimental analysis of self-adjusting computation
inferred← citeshttps://doi.org/10.1145/1596527.1596530openalex-snapshot
An experimental analysis of self-adjusting computation
inferred← citeshttps://doi.org/10.1145/3046673openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1145/513400.513430openalex-snapshot
Optimally cutting a surface into a disk
inferred← citeshttps://doi.org/10.22028/d291-26543openalex-snapshot
Toward better computation models for modern machines
inferred← citeshttps://doi.org/10.32782/cmis/2353-50openalex-snapshot
Automation Methods for Processing Medical Images Based on the Application of Grids
inferred← citeshttps://doi.org/10.3390/a11120195openalex-snapshot
Convex-Hull Algorithms: Implementation, Testing, and Experimentation
inferred← citeshttps://doi.org/10.3390/axioms11090439openalex-snapshot
A Multi-Phase Method for Euclidean Traveling Salesman Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00184openalex-snapshot
Instance Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0207004openalex-snapshot
Optimally cutting a surface into a disk
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.