CUDA implementation of Wagener's 2D convex hull PRAM algorithm
Colm O. Dunlaing

TL;DR
This paper presents a CUDA implementation of Wagener's 2D convex hull PRAM algorithm, demonstrating how parallel GPU computing can be applied to classical computational geometry problems.
Contribution
It introduces a CUDA-based implementation of Wagener's convex hull algorithm, adapting PRAM parallelism to GPU architecture.
Findings
Efficient GPU implementation of Wagener's convex hull algorithm
Demonstrates parallelization benefits for computational geometry
Presented in Knuth's literate programming style
Abstract
This paper describes a CUDA implementation of Wagener's PRAM convex hull algorithm in two dimensions. It is presented in Knuth's literate programming style.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Computational Geometry and Mesh Generation · Optimization and Packing Problems
