Polytopes in arrangements

DOI10.1007/S004540010066MaRDI QIDQ1592511zbMATH OpenOpenAlexFDO

Authors R. Smith

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

zbMATH Keywords

convex polytopesarrangement of \(n\) hyperplanes in \(\mathbb{R}^d\)maximum combinatorial complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• Counting facets and incidences
• Bounding the number of \(k\)-faces in arrangements of hyperplanes
• The complexity of cells in three-dimensional arrangements
• Cells with many facets in arrangements of hyperplanes
• A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)

Cited in

(15)

• A simplicial 3-arrangement of 21 planes
• All-different polytopes
• Counting Blanks in Polygonal Arrangements
• Polytopes, permutation shapes and bin packing
• ARRANGEMENTS OF HOMOTHETS OF A CONVEX BODY
• On hyperplanes and polytopes
• Almost tight bound for a single cell in an arrangement of convex polyhedra in \(\mathbb{R}^3\)
• Amalgamation in the pentagon variety
• INDUCING POLYGONS OF LINE ARRANGEMENTS
• scientific article; zbMATH DE number 1687058 (Why is no real title available?)
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• Excess in arrangements of segments
• scientific article; zbMATH DE number 2209725 (Why is no real title available?)
• Patchworking arrangements of a cubic and a quartic
• A bound on local minima of arrangements that implies the upper bound theorem

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)