Geometric applications of a randomized optimization technique
From MaRDI portal
Recommendations
Cited in
(62)- Computing the least quartile difference estimator in the plane
- A (slightly) faster algorithm for Klee's measure problem
- Applications of random sampling to on-line algorithms in computational geometry
- Computing a minimum-width square or rectangular annulus with outliers
- Efficient randomized algorithms for some geometric optimization problems
- The 2-center problem in three dimensions
- Smallest \(k\)-enclosing rectangle revisited
- Rearranging a sequence of points onto a line
- Bichromatic 2-center of pairs of points
- On interval and circular-arc covering problems
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- Three problems about simple polygons
- Algorithms for bivariate zonoid depth
- On finding a large number of 3D points with a small diameter
- An optimal randomized algorithm for \(d\)-variate zonoid depth
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers
- THE ALIGNED K-CENTER PROBLEM
- Randomized optimization: a probabilistic analysis
- CONSTRUCTING OPTIMAL HIGHWAYS
- Explicit and implicit enforcing -- randomized optimization
- Towards an optimal method for dynamic planar point location
- Simplex Range Searching and Its Variants: A Review
- scientific article; zbMATH DE number 1857642 (Why is no real title available?)
- The Clarkson–Shor Technique Revisited and Extended
- COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
- On the stretch factor of polygonal chains
- Triangles and girth in disk graphs and transmission graphs
- Smallest k-enclosing rectangle revisited
- On the stretch factor of polygonal chains
- Dynamic planar orthogonal point location in sublogarithmic time
- Dominance product and high-dimensional closest pair under \(L_\infty\)
- The domination heuristic for LP-type problems
- Square and Rectangle Covering with Outliers
- Fitting flats to points with outliers
- Geometric optimization and sums of algebraic functions
- Geometric optimization and sums of algebraic functions
- Optimal algorithms for geometric centers and depth
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- On approximate range counting and depth
- Intersecting disks using two congruent disks
- Intersecting disks using two congruent disks
- A simple sampling lemma: Analysis and applications in geometric optimization
- Parametric search made practical
- Faster algorithms for largest empty rectangles and boxes
- Covering points by disjoint boxes with outliers
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Algorithms for computing closest points for segments
- Convex polygon containment: improving quadratic to near linear time
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Algorithms for computing closest points for segments
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- Faster algorithms for largest empty rectangles and boxes
- A parallel batch-dynamic data structure for the closest pair problem
- Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
- Hitting and covering affine families of convex polyhedra, with applications to robust optimization
- Approximating Klee's measure problem and a lower bound for union volume estimation
- Faster algorithms for reverse shortest path in unit-disk graphs and related geometric optimization problems: improving the shrink-and-bifurcate technique
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Optimal location of transportation devices
- Geometric pattern matching for point sets in the plane under similarity transformations
This page was built for publication: Geometric applications of a randomized optimization technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809511)
