On the public citation graph
Parallel algorithms for the convex hull problem in two dimensions
0 signed · 26 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.1016/0020-0190(79)90072-3openalex-snapshot
Another efficient algorithm for convex hulls in two dimensions
inferredcites →https://doi.org/10.1016/s0022-0000(73)80043-1openalex-snapshot
Optimal algorithms for parallel polynomial evaluation
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/359131.359132openalex-snapshot
An optimal real-time algorithm for planar convex hulls
inferredcites →https://doi.org/10.1145/359423.359430openalex-snapshot
Convex hulls of finite sets of points in two and three dimensions
inferredcites →https://doi.org/10.1145/359576.359582openalex-snapshot
Fast parallel sorting algorithms
inferredcites →https://doi.org/10.1145/360881.360919openalex-snapshot
Determining the minimum-area encasing rectangle for an arbitrary closed curve
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/3-540-18099-0_45openalex-snapshot
What can be parallelized in computational geometry?
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_104openalex-snapshot
A survey of parallel computational geometry algorithms
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/bf02243071openalex-snapshot
Optimal parallel algorithms for computing convex hulls and for sorting
inferred← citeshttps://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferred← citeshttps://doi.org/10.1016/0010-4485(90)90002-topenalex-snapshot
Distributed algorithm for the planar convex hull problem
inferred← citeshttps://doi.org/10.1016/0167-8191(85)90030-4openalex-snapshot
Two parallel algorithms for the convex hull problem in a two dimensional space
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90028-8openalex-snapshot
A parallel-design distributed-implementation (PDDI) general-purpose computer
inferred← citeshttps://doi.org/10.1016/b978-0-444-87806-9.50006-2openalex-snapshot
Optimal Parallel Algorithms for Selection, Sorting and Computing Convex Hulls
inferred← citeshttps://doi.org/10.1109/12.21120openalex-snapshot
Mesh computer algorithms for computational geometry
inferred← citeshttps://doi.org/10.1109/12.9737openalex-snapshot
Efficient parallel convex hull algorithms
inferred← citeshttps://doi.org/10.1109/34.16713openalex-snapshot
A bibliography on digital and computational convexity (1961-1988)
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6029openalex-snapshot
Parallel Algorithms for Constructing Convex Hulls.
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.