Pages that link to "Item:Q3835020"
From MaRDI portal
The following pages link to An Optimal-Time Algorithm for Slope Selection (Q3835020):
Displaying 41 items.
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- Parametric search made practical (Q598230) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Repeated median and hybrid filters (Q959316) (← links)
- A practical approximation algorithm for the LMS line estimator (Q1019876) (← links)
- Randomized optimal algorithm for slope selection (Q1182097) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Incomplete generalized \(L\)-statistics (Q1354475) (← links)
- Optimal slope selection via cuttings (Q1388130) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
- The complexity of hyperplane depth in the plane (Q1423588) (← links)
- Space-time trade-offs for some ranking and searching queries (Q1603491) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- Detection of Lines by Combinatorial Optimization (Q3438918) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Minimizing the Maximum Moving Cost of Interval Coverage (Q5894681) (← links)
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses (Q5943320) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
- Computing balanced convex partitions of lines (Q6174825) (← links)
- Some geometric lower bounds (Q6487948) (← links)
