On the public citation graph
An efficient and numerically correct algorithm for the 2D convex hull problem
0 signed · 31 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/bf01934510openalex-snapshot
Some performance tests of convex hull algorithms
inferredcites →https://doi.org/10.1007/bf01937482openalex-snapshot
Delaunay triangulation and the convex hull ofn points in expected linear time
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)90051-0openalex-snapshot
Divide and conquer for linear expected time
inferredcites →https://doi.org/10.1016/0167-8655(88)90077-3openalex-snapshot
A fast approximation to a convex hull
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50011-6openalex-snapshot
Practical use of Bucketing Techniques in Computational Geometry
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.1145/355759.355766openalex-snapshot
A New Convex Hull Algorithm for Planar Sets
inferredcites →https://doi.org/10.1145/358315.358392openalex-snapshot
Approximation algorithms for convex hulls
inferredcites →https://doi.org/10.1145/73393.73409openalex-snapshot
Analysis of a simple yet efficient convex hull algorithm
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-4-431-68147-2_17openalex-snapshot
Determine Whether Two Line Segments Intersect
inferred← citeshttps://doi.org/10.1007/bf00989281openalex-snapshot
An auxiliary theorem for stability analysis in the presence of interval-valued parameters
inferred← citeshttps://doi.org/10.1016/s0010-4485(00)00050-6openalex-snapshot
Reliable line segment intersection testing
inferred← citeshttps://doi.org/10.1016/s0096-3003(98)00010-1openalex-snapshot
Exact computation of the sign of a finite sum
inferred← citeshttps://doi.org/10.1023/a:1009934225596openalex-snapshot
Exact Computation of Delaunay and Power Triangulations
inferred← citeshttps://doi.org/10.1108/02644409910304086openalex-snapshot
Convex hull of a planar set of straight and circular line segments
inferred← citeshttps://doi.org/10.1142/s0218195900000085openalex-snapshot
EXACT AND OPTIMAL CONVEX HULLS IN 2D
inferred← citeshttps://doi.org/10.1533/9780857099518.185openalex-snapshot
The SCCI-Hybrid Method for 2D-Curve Tracing
inferred← citeshttps://doi.org/10.1533/9780857099518.219openalex-snapshot
Interval Versions of Bernstein Polynomials, Bézier Curves and the de Casteljau Algorithm
inferred← citeshttps://doi.org/10.1533/9780857099518.241openalex-snapshot
Robust Computations of Selected Discrete Problems
inferred← citeshttps://doi.org/10.1533/9780857099518.79openalex-snapshot
The Exact Sign of Sum Algorithm (ESSA)
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.