Polyhedral and algebraic methods in computational geometry
linear programmingcomputational geometrypolynomial equationsalgebraic methodspolytopes and polyhedraGröbner bases
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Research exposition (monographs, survey articles) pertaining to algebraic geometry (14-02) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Polytopes and polyhedra (52B99) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)
- Compressed algebraic cubature over polygons with applications to optical design
- Some recent developments in spectrahedral computation
- Lectures in geometric combinatorics
- scientific article; zbMATH DE number 2247469 (Why is no real title available?)
- Extensions of translation invariant valuations on polytopes
- Computational geometry with independent and dependent uncertainties
- The polymake XML File Format
- scientific article; zbMATH DE number 1301098 (Why is no real title available?)
- Fast algorithms for intersection of non-matching grids using Plücker coordinates
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Sinc Methods on Polyhedra
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams
- scientific article; zbMATH DE number 797341 (Why is no real title available?)
- A framework for \(n\)-dimensional visibility computations
- scientific article; zbMATH DE number 124586 (Why is no real title available?)
- Variety evasive subspace families
- Discrete and computational geometry
- scientific article; zbMATH DE number 5165709 (Why is no real title available?)
- Discrete calculus with cubic cells on discrete manifolds
- PALP: a package for analysing lattice polytopes with applications to toric geometry
- Computing convex hulls and counting integer points with \texttt{polymake}
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Algorithmic geometry. Polyhedric and algebraic methods
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- scientific article; zbMATH DE number 791330 (Why is no real title available?)
- Generalised cone complexes and tropical moduli in polymake
- Editorial
- Cylinders Through Five Points: Computational Algebra and Geometry
- The isospectral problem for flat tori from three perspectives
- Algorithms for the frame of a finitely generated unbounded polyhedron
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- On generalizing Descartes' rule of signs to hypersurfaces
- Real tropicalization and negative faces of the Newton polytope
- Connectivity of parameter regions of multistationarity for multisite phosphorylation networks
- Generalized Permutahedra and Optimal Auctions
- On algebraic dependencies in polygons and polyhedra
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
- Algorithms for tight spans and tropical linear spaces
- Poisson brackets after Jacobi and Plücker
- Voronoi cells in metric algebraic geometry of plane curves
- Local tensor valuations
- Reshaping Convex Polyhedra
- Sublinear circuits for polyhedral sets
Uses Software
This page was built for publication: Polyhedral and algebraic methods in computational geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691570)
