A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)

DOI10.1007/BF02187870zbMath0608.52006MaRDI QIDQ1085799

Franz Aurenhammer

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131009

zbMATH Keywords

projectionaffine equivalence of cell complexes and convex polyhedraconvex tiling

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Polytopes and polyhedra (52Bxx)

Related Items

Duality, sections and projections of certain euclidean tilings, Constructive solution of inverse parametric linear/quadratic programming problems, Conductive rings of nonpolytopal fans, Vertical decomposition of arrangements of hyperplanes in four dimensions, Fitting three-dimensional Laguerre tessellations to foam structures, General truthfulness characterizations via convex analysis, Model based estimation of geometric characteristics of open foams, Power diagram detection with applications to information elicitation, Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic Images, Random Laguerre tessellations, A new duality result concerning Voronoi diagrams, Pre-triangulations and liftable complexes, An efficient algorithm for the three-dimensional diameter problem, Convex equipartitions via equivariant obstruction theory, Many projectively unique polytopes, Fibre tilings, On traces of \(d\)-stresses in the skeletons of lower dimensions of piecewise-linear \(d\)-manifolds, Geometric Aspects of the Space of Triangulations, Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings, Back faces of a face polytope, Image analysis for microstructures based on stochastic models, Properties of parallelotopes equivalent to Voronoi's conjecture, 3D image-based stochastic micro-structure modelling of foams for simulating elasticity, Monotone Paths in Planar Convex Subdivisions and Polytopes, A parallel algorithm for constructing projection polyhedra

Cites Work

• Finding extreme points in three dimensions and solving the post-office problem in the plane
• Recognising polytopical cell complexes and constructing projection polyhedra
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• The classification of zonohedra by means of projective diagrams
• On the perspective deformation of polyhedra
• A convex 3-complex not simplicially isomorphic to a strictly convex complex
• Dynamic Three-Dimensional Linear Programming
• Power Diagrams: Properties, Algorithms and Applications
• A new duality result concerning Voronoi diagrams