Polytopes in arrangements
From MaRDI portal
Publication:1592511
DOI10.1007/S004540010066zbMATH Open0968.52020OpenAlexW2093466950MaRDI QIDQ1592511
Publication date: 20 March 2001
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010066
convex polytopesarrangement of \(n\) hyperplanes in \(\mathbb{R}^d\)maximum combinatorial complexity
Analysis of algorithms and problem complexity (68Q25) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items (9)
A simplicial 3-arrangement of 21 planes ⋮ Excess in arrangements of segments ⋮ Title not available (Why is that?) ⋮ Counting Blanks in Polygonal Arrangements ⋮ Polytopes, permutation shapes and bin packing ⋮ Patchworking arrangements of a cubic and a quartic ⋮ Amalgamation in the pentagon variety ⋮ INDUCING POLYGONS OF LINE ARRANGEMENTS ⋮ All-different polytopes
This page was built for publication: Polytopes in arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592511)
