Linear Optimization Queries

DOI10.1006/jagm.1993.1023zbMath0779.68089OpenAlexW2050356354MaRDI QIDQ4696650

Ji{ří} Matoušek

Publication date: 29 June 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1023

zbMATH Keywords

convex polyhedronVoronoi diagramsconvex hullshalfspacemultidimensional parametric search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (20)

Derandomizing an output-sensitive convex hull algorithm in three dimensions ⋮ APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS ⋮ On geometric optimization with few violated constraints ⋮ Convex hulls under uncertainty ⋮ Optimal partition trees ⋮ Approximate Polytope Membership Queries ⋮ Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square ⋮ Simplex Range Searching and Its Variants: A Review ⋮ The 2-center problem in three dimensions ⋮ Dynamic geometric data structures via shallow cuttings ⋮ A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes ⋮ Diameter, width, closest line pair, and parametric searching ⋮ Output-sensitive results on convex hulls, extreme points, and related problems ⋮ Economical Delone Sets for Approximating Convex Bodies ⋮ A characterization theorem and an algorithm for a convex hull problem ⋮ Unnamed Item ⋮ An optimal convex hull algorithm in any fixed dimension ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ Enumerating a subset of the integer points inside a Minkowski sum ⋮ An Output-Sensitive Convex Hull Algorithm for Planar Objects

This page was built for publication: Linear Optimization Queries