Geometric applications of a randomized optimization technique
From MaRDI portal
Publication:1809511
DOI10.1007/PL00009478zbMath0939.68137OpenAlexW1986084080MaRDI QIDQ1809511
Publication date: 25 November 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009478
Related Items
Computing a minimum-width square or rectangular annulus with outliers, Algorithms for graphs of bounded treewidth via orthogonal range searching, Rearranging a sequence of points onto a line, COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON, Towards an Optimal Method for Dynamic Planar Point Location, Square and Rectangle Covering with Outliers, Parametric search made practical, Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back, Covering points by disjoint boxes with outliers, Faster algorithms for largest empty rectangles and boxes, Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon, Simplex Range Searching and Its Variants: A Review, Three problems about simple polygons, The 2-center problem in three dimensions, Unnamed Item, FITTING FLATS TO POINTS WITH OUTLIERS, Algorithms for bivariate zonoid depth, On finding a large number of 3D points with a small diameter, THE ALIGNED K-CENTER PROBLEM, Optimal location of transportation devices, On approximate range counting and depth, An optimal randomized algorithm for \(d\)-variate zonoid depth, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D, Bichromatic 2-center of pairs of points, Unnamed Item, Geometric pattern matching for point sets in the plane under similarity transformations, Unnamed Item, CONSTRUCTING OPTIMAL HIGHWAYS, Intersecting disks using two congruent disks, Smallest \(k\)-enclosing rectangle revisited, Unnamed Item, Intersecting disks using two congruent disks, Computing a Minimum-Width Square or Rectangular Annulus with Outliers, Computing the least quartile difference estimator in the plane, Smallest k-enclosing rectangle revisited, A (slightly) faster algorithm for Klee's measure problem, On interval and circular-arc covering problems, Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points, On the Stretch Factor of Polygonal Chains, Optimal Algorithms for Geometric Centers and Depth, Dominance Product and High-Dimensional Closest Pair under L_infty
