In-place planar convex hull algorithms
From MaRDI portal
Recommendations
- Space-efficient planar convex hull algorithms
- The Ultimate Planar Convex Hull Algorithm?
- Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
Cited in
(9)- Synergistic solutions for merging and computing planar convex hulls
- In-place graph rewriting with interaction nets
- Towards in-place geometric algorithms and data structures
- Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
- Space-efficient planar convex hull algorithms
- The two variable per inequality abstract domain
- Constant workspace algorithms for computing relative hulls in the plane
- In-place algorithms for computing a largest clique in geometric intersection graphs
- Space-efficient geometric divide-and-conquer algorithms
This page was built for publication: In-place planar convex hull algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3044350)