Pages that link to "Item:Q1356937"

The following pages link to How good are convex hull algorithms? (Q1356937):

Displaying 48 items.

• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
• On a cone covering problem (Q617540) (← links)
• The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
• PALP: a package for analysing lattice polytopes with applications to toric geometry (Q709469) (← links)
• Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
• A linear optimization oracle for zonotope computation (Q824329) (← links)
• Enumeration of Nash equilibria for two-player games (Q847809) (← links)
• Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
• An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
• On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
• Computing monotone disjoint paths on polytopes (Q1016050) (← links)
• Converting between quadrilateral and standard solution sets in normal surface theory (Q1035322) (← links)
• Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
• A reverse search algorithm for the neighborhood problem (Q1306348) (← links)
• Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
• Multiparametric demand transportation problem (Q1604061) (← links)
• Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
• Dealing with imprecise information in group multicriteria decisions: a methodology and a GDSS architecture (Q1887887) (← links)
• Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
• A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
• Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
• The \(d\)-majorization polytope (Q2151568) (← links)
• Constrained random matching (Q2155237) (← links)
• Sum-of-squares methods for controlled invariant sets with applications to model-predictive control (Q2178207) (← links)
• Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball (Q2278205) (← links)
• Two variations of graph test in double description method (Q2322740) (← links)
• Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
• Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
• a-tint: a polymake extension for algorithmic tropical intersection theory (Q2441658) (← links)
• Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
• Convex hulls, oracles, and homology (Q2643561) (← links)
• Packing convex polygons in minimum-perimeter convex hulls (Q2679237) (← links)
• Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← links)
• Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
• The CONEstrip Algorithm (Q2805768) (← links)
• AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES (Q2875648) (← links)
• Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
• Optimizing the double description method for normal surface enumeration (Q3584785) (← links)
• A validation and verification tool for global optimization solvers (Q3598649) (← links)
• IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR (Q3644940) (← links)
• Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
• Continuous Maps from Spheres Converging to Boundaries of Convex Hulls (Q4965873) (← links)
• Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices (Q5116482) (← links)
• Forbidden Vertices (Q5252224) (← links)
• Partial identification in nonseparable binary response models with endogenous regressors (Q6108266) (← links)
• Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square (Q6204466) (← links)