Using Gale transforms in computational geometry
From MaRDI portal
Publication:805285
DOI10.1007/BF01582886zbMATH Open0728.68132MaRDI QIDQ805285FDOQ805285
Authors: Franz Aurenhammer
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Gale and other diagrams (52B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On combinatorial structures of line drawings of polyhedra
- Gale diagrams of convex polytopes and positive spanning sets of vectors
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Visibility of disjoint polygons
- Title not available (Why is that?)
- An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
- Central and parallel projections of polytopes
- Recognising polytopical cell complexes and constructing projection polyhedra
- Title not available (Why is that?)
- A relationship between Gale transforms and Voronoi diagrams
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)