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

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

Mathematics Subject Classification ID

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

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 R^3

Cited in

(16)

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