Output-sensitive results on convex hulls, extreme points, and related problems
From MaRDI portal
Publication:1816463
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4098718 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 589497 (Why is no real title available?)
- scientific article; zbMATH DE number 910884 (Why is no real title available?)
- A combinatorial bound for linear programming and related problems
- An $O(n\log ^2 h)$ Time Algorithm for the Three-Dimensional Convex Hull Problem
- An Algorithm for Convex Polytopes
- An efficient algorithm for determining the convex hull of a finite planar set
- Applications of random sampling in computational geometry. II
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Convex hulls of finite sets of points in two and three dimensions
- Cutting hyperplanes for divide-and-conquer
- Decomposable searching problems I. Static-to-dynamic transformation
- Derandomizing an output-sensitive convex hull algorithm in three dimensions
- Dynamic half-space range reporting and its applications
- Enumerating extreme points in higher dimensions
- Fast detection of polyhedral intersection
- Finding the convex hull facet by facet
- Linear Optimization Queries
- Linear Programming in Linear Time When the Dimension Is Fixed
- Maintenance of configurations in the plane
- On ray shooting in convex polytopes
- On the Average Number of Maxima in a Set of Vectors and Applications
- On the convex layers of a planar set
- On the detection of a common intersection of k convex subjects in the plane
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Ray Shooting and Parametric Search
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Slowing down sorting networks to obtain faster sorting algorithms
- Small-dimensional linear programming and convex hulls made easy
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
- The Ultimate Planar Convex Hull Algorithm?
- The maximum numbers of faces of a convex polytope
- \(k\)-violation linear programming
Cited in
(30)- Approximate polytope membership queries
- On constant factors in comparison-based geometric algorithms and data structures
- Combinatorial redundancy detection
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- Robust vertex enumeration for convex hulls in high dimensions
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Space-efficient planar convex hull algorithms
- ON ENUMERATING AND SELECTING DISTANCES
- Competing output-sensitive frame algorithms
- Convex hull of points lying on lines in \(O(n\log n)\) time after preprocessing
- Finding simplices containing the origin in two and three dimensions
- Optimal, output-sensitive algorithms for constructing planar hulls in parallel
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Incremental convex hull algorithms are not output sensitive
- Convex hull of imprecise points in \(o(n \log n)\) time after preprocessing
- Solving degenerate sparse polynomial systems faster
- Enumerating extreme points in higher dimensions
- On approximate range counting and depth
- Economical Delone sets for approximating convex bodies
- Outlier respecting points approximation
- Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Optimal partition trees
- An output sensitive algorithm for discrete convex hulls
- A characterization theorem and an algorithm for a convex hull problem
- Approximating points by a piecewise linear function
- scientific article; zbMATH DE number 1629823 (Why is no real title available?)
This page was built for publication: Output-sensitive results on convex hulls, extreme points, and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816463)
