Enumerating extreme points in higher dimensions

DOI10.1007/3-540-59042-0_105MaRDI QIDQ4596653zbMATH OpenOpenAlexFDO

Authors Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_105

Mathematics Subject Classification ID

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

Recommendations

• Enumerating extreme points in higher dimensions
• Enumerating extreme points of a highly degenerate polytope
• scientific article; zbMATH DE number 724218
• scientific article; zbMATH DE number 123932
• Computing a high depth point in the plane

Cited in

(15)

• Enumerating extreme points of a highly degenerate polytope
• Combinatorial redundancy detection
• Output-sensitive results on convex hulls, extreme points, and related problems
• Multi-point evaluation in higher dimensions
• On constant factors in comparison-based geometric algorithms and data structures
• Multiparametric linear programming with applications to control
• Enumerating extreme points in higher dimensions
• Probabilistic algorithms for extreme point identification
• Competing output-sensitive frame algorithms
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
• Output-sensitive cell enumeration in hyperplane arrangements
• Enumerating Collinear Points in Higher Dimensions
• Convexity recognition of the union of polyhedra
• Space-efficient planar convex hull algorithms
• 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 Q4596653)