scientific article; zbMATH DE number 7561401
From MaRDI portal
Publication:5091039
DOI10.4230/LIPIcs.ISAAC.2018.47MaRDI QIDQ5091039
Martín Farach-Colton, Meng-Tsung Tsai, Meng Li
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1810.00455
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Optimal parallel algorithms for computing convex hulls and for sorting
- Space-efficient planar convex hull algorithms
- The complexity of incremental convex hull algorithms in \(R^ d\)
- Multi-pass geometric algorithms
- Space-efficient geometric divide-and-conquer algorithms
- Another efficient algorithm for convex hulls in two dimensions
- Maintenance of configurations in the plane
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Adaptive sampling for geometric problems over data streams
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Hausdorff approximation of convex polygons
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
- Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination
- The Ultimate Planar Convex Hull Algorithm?
- The Probabilistic Communication Complexity of Set Intersection
- Convex hulls of finite sets of points in two and three dimensions
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- The quickhull algorithm for convex hulls
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Trading off space for passes in graph streaming problems
This page was built for publication:
