On the public citation graph
Innovative GPU accelerated algorithm for fast minimum convex hulls computation
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.1007/b138823openalex-snapshot
Applied Geometry for Computer Graphics and CAD
inferredcites →https://doi.org/10.1007/bf01934510openalex-snapshot
Some performance tests of convex hull algorithms
inferredcites →https://doi.org/10.1007/bf02712873openalex-snapshot
Optimal output-sensitive convex hull algorithms in two and three dimensions
inferredcites →https://doi.org/10.1007/s10766-013-0252-yopenalex-snapshot
Boosting CUDA Applications with CPU–GPU Hybrid Computing
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.1111/j.1467-9574.1996.tb01478.xopenalex-snapshot
Polyhedral techniques in combinatorial optimization I: Theory
inferredcites →https://doi.org/10.1145/1188455.1188549openalex-snapshot
Memory---A memory model for scientific algorithms on graphics processors
inferredcites →https://doi.org/10.1145/235815.235821openalex-snapshot
The quickhull algorithm for convex hulls
inferredcites →https://doi.org/10.13140/rg.2.1.3186.3844openalex-snapshot
Exploration of Data Coding Methods in Wireless Computer Networks
inferredcites →https://doi.org/10.15439/2014f282openalex-snapshot
Movement Tracking in Terrain Conditions Accelerated with CUDA
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.4236/ajcm.2013.31a003openalex-snapshot
On Constructing Approximate Convex Hull
inferredcites →https://doi.org/10.5281/zenodo.16440openalex-snapshot
Formation And Investigation Of Kruskal’S Algorithm Parallel Scheme For Shared Memory Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5229openalex-snapshot
CudaCHPre2D: A straightforward preprocessing approach for accelerating 2D convex hull computations on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-319-40132-4_1openalex-snapshot
Fast Output-Sensitive Approach for Minimum Convex Hulls Formation
inferred← citeshttps://doi.org/10.1007/s10559-018-0101-5openalex-snapshot
Designing an It Infrastructure
inferred← citeshttps://doi.org/10.1007/s11554-023-01359-8openalex-snapshot
How to compute the convex hull of a binary shape? A real-time algorithm to compute the convex hull of a binary shape
inferred← citeshttps://doi.org/10.1109/atit58178.2022.10024183openalex-snapshot
Wireless Network Planning
inferred← citeshttps://doi.org/10.1109/atit58178.2022.10024234openalex-snapshot
Method Using Partial Data to Confirm Completion of the Tree Parity Machines Synchronization
inferred← citeshttps://doi.org/10.1109/atit58178.2022.10024248openalex-snapshot
Experimental Face Recognition System Based On Improved Artificial Intelligence Model
inferred← citeshttps://doi.org/10.1109/pdp2018.2018.00119openalex-snapshot
CudaPre2D: A Straightforward Preprocessing Approach for Accelerating 2D Convex Hull Computations on the GPU
inferred← citeshttps://doi.org/10.1109/tcset.2016.7452101openalex-snapshot
Investigation of transformations and landscapes for combinatorial optimization problems
inferred← citeshttps://doi.org/10.15407/pp2018.02.149openalex-snapshot
Automated extraction of structured information from a variety of web pages
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.