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.
Recommendations
Cites work
- A relationship between Gale transforms and Voronoi diagrams
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
- Central and parallel projections of polytopes
- Gale diagrams of convex polytopes and positive spanning sets of vectors
- scientific article; zbMATH DE number 3121295 (Why is no real title available?)
- scientific article; zbMATH DE number 3841211 (Why is no real title available?)
- scientific article; zbMATH DE number 3851896 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4067739 (Why is no real title available?)
- On combinatorial structures of line drawings of polyhedra
- Recognising polytopical cell complexes and constructing projection polyhedra
- Visibility of disjoint polygons
Cited in
(3)
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)