Polyhedral and algebraic methods in computational geometry
algebraic methodscomputational geometryGröbner baseslinear programmingpolynomial equationspolytopes and polyhedra
Research exposition (monographs, survey articles) pertaining to algebraic geometry (14-02) Software, source code, etc. for problems pertaining to algebraic geometry (14-04) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Polytopes and polyhedra (52B99) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Linear programming (90C05)
The authors provide a nice survey on algebraic methods in computational geometry. After some preliminary remarks, the first part starts with concepts and techniques of linear structures (polytopes and polyhedra, linear programming problems, description of convex hulls, Voronoi diagrams and Delone triangulations). The second part is an introduction to some primary concepts in nonlinear geometry (systems of polynomial equations, algebraic curves, Gröbner bases). All results are used in the third part for some selected applications in computer graphics, curve reconstructions and robotics. In an appendix the authors present definitions of fundamental algebraic terms, separation concepts for convex sets, foundations of the complexity of algorithms and remarks to the used software.
- Computational synthetic geometry
- Poisson brackets after Jacobi and Plücker
- Algorithms for tight spans and tropical linear spaces
- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Sublinear circuits for polyhedral sets
- On generalizing Descartes' rule of signs to hypersurfaces
- Compressed algebraic cubature over polygons with applications to optical design
- Local tensor valuations
- Computing convex hulls and counting integer points with \texttt{polymake}
- Fast algorithms for intersection of non-matching grids using Plücker coordinates
- The polymake XML File Format
- Algorithms for the frame of a finitely generated unbounded polyhedron
- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
- Cylinders Through Five Points: Computational Algebra and Geometry
- Discrete and computational geometry
- scientific article; zbMATH DE number 4213507 (Why is no real title available?)
- Sinc Methods on Polyhedra
- scientific article; zbMATH DE number 124586 (Why is no real title available?)
- scientific article; zbMATH DE number 1301098 (Why is no real title available?)
- Some recent developments in spectrahedral computation
- scientific article; zbMATH DE number 791330 (Why is no real title available?)
- scientific article; zbMATH DE number 797341 (Why is no real title available?)
- A framework for n-dimensional visibility computations
- Discrete calculus with cubic cells on discrete manifolds
- The isospectral problem for flat tori from three perspectives
- Computational geometry with independent and dependent uncertainties
- Extensions of translation invariant valuations on polytopes
- scientific article; zbMATH DE number 5165709 (Why is no real title available?)
- Algorithmic geometry. Polyhedric and algebraic methods
- Lectures in geometric combinatorics
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- scientific article; zbMATH DE number 2247469 (Why is no real title available?)
- Generalized Permutahedra and Optimal Auctions
- Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry
- Editorial
- Generalised cone complexes and tropical moduli in polymake
- A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
- Reshaping Convex Polyhedra
- Real tropicalization and negative faces of the Newton polytope
- Voronoi cells in metric algebraic geometry of plane curves
- Variety evasive subspace families
- Connectivity of parameter regions of multistationarity for multisite phosphorylation networks
- Geometry of the signed support of a multivariate polynomial and Descartes' rule of signs
- Viro's patchworking and the signed reduced A-discriminant
- Subdivisions of Hypersimplices: With a View Toward Finite Metric Spaces
- On algebraic dependencies in polygons and polyhedra
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
- On exact covering with unit disks
- A robust optimization approach for a two-player force-design game
- PALP: a package for analysing lattice polytopes with applications to toric geometry
- Finite Gröbner bases for quantum symmetric groups
- Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams
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)
