Efficient randomized algorithms for some geometric optimization problems
type: Item
instance of: scholarly article
title: Efficient randomized algorithms for some geometric optimization problems
zbMATH Open document ID: 0857.68109
DOI: 10.1007/BF02712871
published in: Discrete \& Computational Geometry
publication date: 1996-11-26T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 949869
zbMATH Keywords: geometric optimization problems
author: Pankaj K. Agarwal
author: Micha Sharir
MaRDI profile type: Publication
cites work: Applications of Parametric Searching in Geometric Optimization
cites work: Computing the longest diagonal of a simple polygon
cites work: Optimal slope selection via cuttings
cites work: A singly exponential stratification scheme for real semi-algebraic varieties and its applications
cites work: Diameter, width, closest line pair, and parametric searching
cites work: An algorithm for generalized point location and its applications
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: Applications of random sampling in computational geometry. II
cites work: On lazy randomized incremental construction
cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
cites work: Generalised regression problems in metrology
cites work: New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
cites work: \(\epsilon\)-nets and simplex range queries
cites work: Computing the width of a set
cites work: Optimal slope selection via expanders
cites work: Q5433085
cites work: Randomized optimal algorithm for slope selection
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Linear Programming in Linear Time When the Dimension Is Fixed
cites work: On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space
cites work: Almost tight upper bounds for lower envelopes in higher dimensions
cites work: Q4325546
cites work: An optimal algorithm for roundness determination on convex polygons
cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
description: scientific article; zbMATH DE number 949869