Using Gale transforms in computational geometry

DOI10.1007/BF01582886zbMath0728.68132MaRDI QIDQ805285

Franz Aurenhammer

Publication date: 1991

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

visibilityconvex hullsscene analysisGale transforms

Mathematics Subject Classification ID

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

• Gale diagrams of convex polytopes and positive spanning sets of vectors
• An algebraic and combinatorial approach to the analysis of line drawings of polyhedra
• A relationship between Gale transforms and Voronoi diagrams
• Central and parallel projections of polytopes
• Visibility of disjoint polygons
• Recognising polytopical cell complexes and constructing projection polyhedra
• On combinatorial structures of line drawings of polyhedra
• A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item