Recognising polytopical cell complexes and constructing projection polyhedra
From MaRDI portal
Publication:1096404
DOI10.1016/S0747-7171(87)80003-2zbMath0633.68086OpenAlexW1993481043MaRDI QIDQ1096404
Publication date: 1987
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(87)80003-2
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Polytopes and polyhedra (52Bxx)
Related Items
Constructive solution of inverse parametric linear/quadratic programming problems, A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\), General truthfulness characterizations via convex analysis, Power diagram detection with applications to information elicitation, Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic Images, Weavings, sections and projections of spherical polyhedra, Weighted skeletons and fixed-share decomposition, Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings, On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs, A parallel algorithm for constructing projection polyhedra, Using Gale transforms in computational geometry
Cites Work
- Recognizing Dirichlet tesselations
- Finding extreme points in three dimensions and solving the post-office problem in the plane
- Spherical complexes and radial projections of polytopes
- On the perspective deformation of polyhedra
- On the perspective deformation of polyhedra. II. Solution of the convexity problem
- APPROXIMATION OF A TESSELLATION OF THE PLANE BY A VORONOI DIAGRAM
- Constructing Arrangements of Lines and Hyperplanes with Applications
- A convex 3-complex not simplicially isomorphic to a strictly convex complex
- Power Diagrams: Properties, Algorithms and Applications
- Unnamed Item
- Unnamed Item
