Using Gale transforms in computational geometry

From MaRDI portal





The author gives an interesting example of a powerful solution technique in computational geometry. For the transformation techniques of Gale transforms, which are known from combinatorial geometry, efficient algorithmic solutions for particular questions from theory of convex hulls, visibility, and scene analysis are given. The results give answers to questions in general finite dimensions. The author believes, that this technique of transformation will also apply to other problems in combinatorial geometry.











This page was built for publication: Using Gale transforms in computational geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805285)