Pages that link to "Item:Q1176319"
From MaRDI portal
The following pages link to Small-dimensional linear programming and convex hulls made easy (Q1176319):
Displaying 30 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Complexity of projected images of convex subdivisions (Q1841991) (← links)
- Randomized algorithms for the separation of point sets and for solving quadratic programs (Q1895800) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- A quick negative selection algorithm for one-class classification in big data era (Q1992686) (← links)
- Stabbing pairwise intersecting disks by five points (Q2032723) (← links)
- Random sampling with removal (Q2207595) (← links)
- Generation of dangerous disturbances for flight systems (Q2292091) (← links)
- A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
- Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
- General models in min-max planar location: Checking optimality conditions (Q2564175) (← links)
- Convex hulls, oracles, and homology (Q2643561) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Lower bounds for a subexponential optimization algorithm (Q4312749) (← links)
- Two-variable linear programming in parallel (Q5054853) (← links)
- A unified approach to tail estimates for randomized incremental construction (Q5088886) (← links)
- (Q5091042) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
