Linear Optimization Queries

DOI10.1006/JAGM.1993.1023MaRDI QIDQ4696650zbMATH OpenOpenAlexFDO

Authors 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 hullsVoronoi diagramsconvex polyhedronhalfspacemultidimensional parametric search

Mathematics Subject Classification ID

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

Recommendations

• Small-dimensional linear programming and convex hulls made easy
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Dynamic Three-Dimensional Linear Programming
• scientific article; zbMATH DE number 724218
• An optimal convex hull algorithm in any fixed dimension

Cited in

(21)

• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
• Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square
• Dynamic geometric data structures via shallow cuttings
• Derandomizing an output-sensitive convex hull algorithm in three dimensions
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Approximate polytope membership queries
• An optimal convex hull algorithm in any fixed dimension
• Economical Delone sets for approximating convex bodies
• Enumerating a subset of the integer points inside a Minkowski sum
• Polytope approximation and the Mahler volume
• Optimal algorithms for geometric centers and depth
• Output-sensitive results on convex hulls, extreme points, and related problems
• On geometric optimization with few violated constraints
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• The 2-center problem in three dimensions
• Optimal partition trees
• Simplex Range Searching and Its Variants: A Review
• An Output-Sensitive Convex Hull Algorithm for Planar Objects
• Can linear superiorization be useful for linear optimization problems?
• A characterization theorem and an algorithm for a convex hull problem
• Diameter, width, closest line pair, and parametric searching

This page was built for publication: Linear Optimization Queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4696650)