Polyhedral and algebraic methods in computational geometry (Q691570): Difference between revisions

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.