A sublogarithmic convex hull algorithm
From MaRDI portal
Publication:911280
DOI10.1007/BF01931655zbMATH Open0696.68056OpenAlexW1986754491MaRDI QIDQ911280FDOQ911280
Authors: Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson 
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01931655
Recommendations
- An approximate algorithm for computing multidimensional convex hulls
- An optimal convex hull algorithm in any fixed dimension
- A fast approximation to a convex hull
- Sublinear Geometric Algorithms
- Sublinear geometric algorithms
- The quickhull algorithm for convex hulls
- A characterization theorem and an algorithm for a convex hull problem
- Exact and approximate map-reduce algorithms for convex hull
- scientific article; zbMATH DE number 828002
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cites Work
- An efficient algorithm for determining the convex hull of a finite planar set
- Title not available (Why is that?)
- Finding the maximum, merging, and sorting in a parallel computation model
- Optimal bounds for decision problems on the CRCW PRAM
- Faster optimal parallel prefix sums and list ranking
- Finding the convex hull of a sorted point set in parallel
- Parallel algorithms for some functions of two convex polygons
- Parallel computational geometry
- Optimal parallel algorithms for point-set and polygon problems
Cited In (17)
- A BSP realisation of Jarvis' algorithm
- Finding the Convex Hull of Discs in Parallel
- Title not available (Why is that?)
- Constructing the convex hull of a partially sorted set of points
- Title not available (Why is that?)
- THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
- A 2-D parallel convex hull algorithm with optimal communication phases
- Robust algorithms for constructing strongly convex hulls in parallel.
- Parallel construction of subdivision hierarchies
- A 1 log N parallel algorithm for detecting convex hulls on image boards
- CONSTRUCTING A STRONGLY CONVEX SUPERHULL OF POINTS
- Finding the convex hull of a sorted point set in parallel
- Efficient parallel convex hull algorithms
- New serial and parallel algorithms for finding convex hull based on clusters, domains and directions from single to multitude
- On the complexity of convex hull algorithms if rotational minima can be found very fast
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
- An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
This page was built for publication: A sublogarithmic convex hull algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911280)
