Divide and conquer for linear expected time
From MaRDI portal
Cites work
- A New Convex Hull Algorithm for Planar Sets
- An efficient algorithm for determining the convex hull of a finite planar set
- Convex hulls of finite sets of points in two and three dimensions
- Die konvexe H�lle von n rotationssymmetrisch verteilten Punkten
- scientific article; zbMATH DE number 3172297 (Why is no real title available?)
- scientific article; zbMATH DE number 3557226 (Why is no real title available?)
- scientific article; zbMATH DE number 1849873 (Why is no real title available?)
- scientific article; zbMATH DE number 3314836 (Why is no real title available?)
- On the identification of the convex hull of a finite set of points in the plane
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
- The convex hull of a random set of points
- ZufÄllige konvexe Polygone in einem Ringgebiet
- �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten. II
Cited in
(41)- A note on the expected time required to construct the outer layer
- Lipschitz condition in minimum norm problems on bounded functions
- Exact balancing is not always good
- Quasi-convex optimization
- On determining the on-line minimax linear fit to a discrete point set in the plane
- Some problems in computational geometry
- Fast algorithms for computing the diameter of a finite planar set
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
- Another efficient algorithm for convex hulls in two dimensions
- Voronoi diagrams from convex hulls
- The relative neighbourhood graph of a finite planar set
- A note on linear expected time algorithms for finding convex hulls
- A note on finding convex hulls via maximal vectors
- Further comments on Bykat's convex hull algorithm
- How to reduce the average complexity of convex hull finding algorithms
- On the computer generation of random convex hulls
- Maintenance of configurations in the plane
- Moment inequalities for random variables in computational geometry
- Convex hulls of samples from spherically symmetric distributions
- Fast linear expected-time algorithms for computing maxima and convex hulls
- On the variance of the number of maxima in random vectors and its applications
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- The plane with parallel coordinates
- On the average number of maximal in a set of vectors
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions
- A simple algorithm for building the 3-D convex hull
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points
- Records, the maximal layer, and uniform distributions in monotone sets
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- The average performance analysis of a closest‐pair algorithm
- Convex Hulls of Random Walks
- On random cartesian trees
- DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS
- On computing approximate convex hulls
- Comments on convex hull of a finite set of points in two dimensions
- Comments on convex hull of a finite set of points in two dimensions
- Randomized quickhull
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy
- Linear time algorithms for convex and monotone approximation
- An efficient and numerically correct algorithm for the 2D convex hull problem
This page was built for publication: Divide and conquer for linear expected time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256853)
