Geometric applications of a randomized optimization technique

Cited In (46)

Towards an Optimal Method for Dynamic Planar Point Location
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Bichromatic 2-center of pairs of points
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
Optimal Algorithms for Geometric Centers and Depth
Smallest k-enclosing rectangle revisited
Algorithms for bivariate zonoid depth
On finding a large number of 3D points with a small diameter
Computing a minimum-width square or rectangular annulus with outliers
An optimal randomized algorithm for \(d\)-variate zonoid depth
A (slightly) faster algorithm for Klee's measure problem
On the Stretch Factor of Polygonal Chains
Smallest \(k\)-enclosing rectangle revisited
Title not available (Why is that?)
THE ALIGNED K-CENTER PROBLEM
Title not available (Why is that?)
Rearranging a sequence of points onto a line
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Applications of random sampling to on-line algorithms in computational geometry
Optimal location of transportation devices
Geometric pattern matching for point sets in the plane under similarity transformations
Computing a Minimum-Width Square or Rectangular Annulus with Outliers
Computing the least quartile difference estimator in the plane
Title not available (Why is that?)
CONSTRUCTING OPTIMAL HIGHWAYS
FITTING FLATS TO POINTS WITH OUTLIERS
Three problems about simple polygons
A simple sampling lemma: Analysis and applications in geometric optimization
Intersecting disks using two congruent disks
Intersecting disks using two congruent disks
Square and Rectangle Covering with Outliers
On approximate range counting and depth
Faster algorithms for largest empty rectangles and boxes
The 2-center problem in three dimensions
Dominance Product and High-Dimensional Closest Pair under L_infty
Simplex Range Searching and Its Variants: A Review
Parametric search made practical
On interval and circular-arc covering problems
Algorithms for graphs of bounded treewidth via orthogonal range searching
Covering points by disjoint boxes with outliers
Title not available (Why is that?)
Title not available (Why is that?)
The Clarkson–Shor Technique Revisited and Extended
Title not available (Why is that?)

   Recommendations

Title not available (Why is that?) 👍 👎
Efficient randomized algorithms for some geometric optimization problems 👍 👎
Applications of random sampling to on-line algorithms in computational geometry 👍 👎
Title not available (Why is that?) 👍 👎

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)