On the public citation graph
A note on linear expected time algorithms for finding convex hulls
0 signed · 63 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/bf00531885openalex-snapshot
Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
inferredcites →https://doi.org/10.1007/bf02243418openalex-snapshot
Average time behavior of distributive sorting algorithms
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
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/0020-0190(80)90036-8openalex-snapshot
A note on finding convex hulls via maximal vectors
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.1145/322092.322095openalex-snapshot
On the Average Number of Maxima in a Set of Vectors and Applications
inferredcites →https://doi.org/10.1145/355759.355766openalex-snapshot
A New Convex Hull Algorithm for Planar Sets
inferredcites →https://doi.org/10.1145/355921.355927openalex-snapshot
Optimal Expected-Time Algorithms for Closest Point Problems
inferredcites →https://doi.org/10.1214/aoms/1177728174openalex-snapshot
Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
inferredcites →https://doi.org/10.21236/ada066740openalex-snapshot
Optimal Expected-Time Algorithms for Closest-Point Problems
inferredcites →https://doi.org/10.2307/2288022openalex-snapshot
An Introduction to Probability Theory.
inferredcites →https://doi.org/10.2307/2314609openalex-snapshot
An Introduction to Probability Theory and Its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1503openalex-snapshot
Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers
inferred← citeshttps://doi.org/10.1007/978-1-4613-9464-8_12openalex-snapshot
Recent Results on the Average Time Behavior of Some Algorithms in Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4757-3609-0_5openalex-snapshot
Discrete Computing with Coarse Grained Parallel Systems: An Algorithmic Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-03577-8_63openalex-snapshot
Matchstick Games: On Removing a Matchstick Without Disturbing the Others
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_30openalex-snapshot
A Faster Convex-Hull Algorithm via Bucketing
inferred← citeshttps://doi.org/10.1007/978-4-431-68057-4_7openalex-snapshot
Fast Algorithms for Computing the Diameter of a Finite Planar Set
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1007/978-94-009-7772-3_7openalex-snapshot
Computational Geometric Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1007/bf01901195openalex-snapshot
Fast algorithms for computing the diameter of a finite planar set
inferred← citeshttps://doi.org/10.1007/bf02280782openalex-snapshot
Moment inequalities for random variables in computational geometry
inferred← citeshttps://doi.org/10.1007/bf02770866openalex-snapshot
Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
inferred← citeshttps://doi.org/10.1007/s10589-025-00682-zopenalex-snapshot
Inner $$\delta $$-approximation of the convex hull of finite sets
inferred← citeshttps://doi.org/10.1007/s10707-025-00538-yopenalex-snapshot
An in-place Quickhull algorithm
inferred← citeshttps://doi.org/10.1016/0010-4655(87)90055-5openalex-snapshot
Computing the convex hull of a set of points
inferred← citeshttps://doi.org/10.1016/0098-3004(91)90050-nopenalex-snapshot
An ANSI C program to determine in expected linear time the vertices of the convex hull of a set of planar points
inferred← citeshttps://doi.org/10.1016/0167-8655(85)90039-xopenalex-snapshot
On the ultimate convex hull algorithm in practice
inferred← citeshttps://doi.org/10.1016/0196-6774(83)90040-8openalex-snapshot
Efficient algorithms for computing the maximum distance between two finite planar sets
inferred← citeshttps://doi.org/10.1016/0262-8856(83)90065-3openalex-snapshot
Time- and storage-efficient implementation of an optimal planar convex hull algorithm
inferred← citeshttps://doi.org/10.1016/0898-1221(82)90035-9openalex-snapshot
On the computer generation of random convex hulls
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50007-4openalex-snapshot
Simple On-Line Algorithms for Convex Polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot
On Geometric Algorithms that use the Furthest-Point Voronoi Diagram
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50010-4openalex-snapshot
Expected Time Analysis of Algorithms in Computational Geometry
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.jbi.2012.09.005openalex-snapshot
Is standard multivariate analysis sufficient in clinical and epidemiological studies?
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1080/0020739031000071511openalex-snapshot
On the role of kinesthetic thinking in computational geometry
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.1109/sege.2016.7589536openalex-snapshot
Predictive modeling of dissolved gas concentrationin oil-immersed substation transformers
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1109/waina.2011.64openalex-snapshot
Fast Two Dimensional Convex Hull on the GPU
inferred← citeshttps://doi.org/10.1117/12.2216929openalex-snapshot
Computer-aided detection of human cone photoreceptor inner segments using multi-scale circular voting
inferred← citeshttps://doi.org/10.1117/12.2217191openalex-snapshot
A fully automatic framework for cell segmentation on non-confocal adaptive optics images
inferred← citeshttps://doi.org/10.1145/31846.32221openalex-snapshot
Convexity algorithms in parallel coordinates
inferred← citeshttps://doi.org/10.1145/73393.73409openalex-snapshot
Analysis of a simple yet efficient convex hull algorithm
inferred← citeshttps://doi.org/10.11650/tjm/260104openalex-snapshot
Methods for Identifying All Extreme Points of Convex Hulls in Spaces of Dimension Greater than 3 Revisited
inferred← citeshttps://doi.org/10.1167/iovs.18-24734openalex-snapshot
Cone Photoreceptor Cell Segmentation and Diameter Measurement on Adaptive Optics Images Using Circularly Constrained Active Contour Model
inferred← citeshttps://doi.org/10.1364/oe.24.023707openalex-snapshot
Common phase error estimation in coherent optical OFDM systems using best-fit bounding box
inferred← citeshttps://doi.org/10.3390/a11120195openalex-snapshot
Convex-Hull Algorithms: Implementation, Testing, and Experimentation
inferred← citeshttps://doi.org/10.3390/aerospace11040323openalex-snapshot
A Resilient Approach to a Test Rig Setup in the Qualification of a Tilt Rotor Carbon Fiber-Reinforced Polymer (CFRP) Wing
inferred← citeshttps://doi.org/10.3744/snak.2014.51.3.203openalex-snapshot
A Study on the Generation of Block Projections for the Assembly Shops
inferred← citeshttps://doi.org/10.4038/cjs.v50i3.7907openalex-snapshot
An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
inferred← citeshttps://doi.org/10.48550/arxiv.1511.03576openalex-snapshot
DataGrinder: Fast, Accurate, Fully non-Parametric Classification Approach Using 2D Convex Hulls
inferred← citeshttps://doi.org/10.48550/arxiv.2107.14274openalex-snapshot
Interactive Region-of-Interest Discovery using Exploratory Feedback
inferred← citeshttps://doi.org/10.9717/kmms.2014.17.12.1430openalex-snapshot
Fingertip Touch Recognition using Shadow Information for General Wall Touch Screen
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.