Enumerating extreme points in higher dimensions
From MaRDI portal
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Enumerating extreme points in higher dimensions
- scientific article; zbMATH DE number 724218
- scientific article; zbMATH DE number 2185596
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Output-sensitive results on convex hulls, extreme points, and related problems
Cited in
(9)- Enumerating extreme points of a highly degenerate polytope
- Multi-point evaluation in higher dimensions
- scientific article; zbMATH DE number 2185596 (Why is no real title available?)
- Competing output-sensitive frame algorithms
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- Enumerating extreme points in higher dimensions
- Enumerating Collinear Points in Higher Dimensions
- Simple multi-pass streaming algorithms for skyline points and extreme points
- Methods for identifying all extreme points of convex hulls in spaces of dimension greater than 3 revisited
This page was built for publication: Enumerating extreme points in higher dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2748152)
