Pages that link to "Item:Q1256853"
From MaRDI portal
The following pages link to Divide and conquer for linear expected time (Q1256853):
Displaying 41 items.
- On computing approximate convex hulls (Q584737) (← links)
- Randomized quickhull (Q675302) (← links)
- Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy (Q760204) (← links)
- Linear time algorithms for convex and monotone approximation (Q792060) (← links)
- An efficient and numerically correct algorithm for the 2D convex hull problem (Q919797) (← links)
- A note on the expected time required to construct the outer layer (Q1062448) (← links)
- Lipschitz condition in minimum norm problems on bounded functions (Q1067133) (← links)
- Exact balancing is not always good (Q1072369) (← links)
- Quasi-convex optimization (Q1078102) (← links)
- On determining the on-line minimax linear fit to a discrete point set in the plane (Q1098638) (← links)
- Some problems in computational geometry (Q1101225) (← links)
- Fast algorithms for computing the diameter of a finite planar set (Q1104078) (← links)
- An O(n) algorithm for discrete n-point convex approximation with applications to continuous case (Q1132491) (← links)
- Another efficient algorithm for convex hulls in two dimensions (Q1134526) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- The relative neighbourhood graph of a finite planar set (Q1141155) (← links)
- A note on linear expected time algorithms for finding convex hulls (Q1142045) (← links)
- A note on finding convex hulls via maximal vectors (Q1144946) (← links)
- Further comments on Bykat's convex hull algorithm (Q1147518) (← links)
- How to reduce the average complexity of convex hull finding algorithms (Q1151049) (← links)
- On the computer generation of random convex hulls (Q1155367) (← links)
- Maintenance of configurations in the plane (Q1158972) (← links)
- Moment inequalities for random variables in computational geometry (Q1172863) (← links)
- Convex hulls of samples from spherically symmetric distributions (Q1175782) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- On the variance of the number of maxima in random vectors and its applications (Q1296610) (← links)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098) (← links)
- The plane with parallel coordinates (Q1822057) (← links)
- On the average number of maximal in a set of vectors (Q1824385) (← links)
- Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\) (Q1894936) (← links)
- O(n) algorithms for discrete n-point approximation by quasi-convex functions (Q2266345) (← links)
- A simple algorithm for building the 3-D convex hull (Q2266570) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- Records, the maximal layer, and uniform distributions in monotone sets (Q2365949) (← links)
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications (Q3033808) (← links)
- The average performance analysis of a closest‐pair algorithm (Q3339288) (← links)
- Convex Hulls of Random Walks (Q4039322) (← links)
- On random cartesian trees (Q4286297) (← links)
- DATA GENERATION FOR GEOMETRIC ALGORITHMS ON NON-UNIFORM DISTRIBUTIONS (Q4682200) (← links)
- Comments on convex hull of a finite set of points in two dimensions (Q5893906) (← links)
- Comments on convex hull of a finite set of points in two dimensions (Q5906209) (← links)
