Pages that link to "Item:Q1809511"
From MaRDI portal
The following pages link to Geometric applications of a randomized optimization technique (Q1809511):
Displaying 45 items.
- Parametric search made practical (Q598230) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
- Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Bichromatic 2-center of pairs of points (Q2261579) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- (Q4788601) (← links)
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON (Q4818604) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5075809) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5092418) (← links)
- Dynamic planar orthogonal point location in sublogarithmic time (Q5115793) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- Square and Rectangle Covering with Outliers (Q5321703) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner \((p, q)\)-theorem (Q5881548) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
- A simple sampling lemma: Analysis and applications in geometric optimization (Q5939470) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
