The complexity of many cells in arrangements of planes and related problems
From MaRDI portal
Publication:582901
Recommendations
- Cell complexities in hyperplane arrangements
- On the sum of squares of cell complexities in hyperplane arrangements
- On the complexity of arrangements of circles in the plane
- Cells with many facets in arrangements of hyperplanes
- scientific article; zbMATH DE number 4151859
- Combinatorial simpliciality of arrangements of hyperplanes
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning
- scientific article; zbMATH DE number 177187
- Combinatorial complexity bounds for arrangements of curves and spheres
- scientific article; zbMATH DE number 3847039
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A theorem on arrangements of lines in the plane
- Combinatorial complexity bounds for arrangements of curves and spheres
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Extremal problems in discrete geometry
- Fast detection of polyhedral intersection
- Finding the intersection of n half-spaces in time O(n log n)
- How to search in history
- Implicitly representing arrangements of lines or segments
- New applications of random sampling in computational geometry
- On the maximal number of edges of many faces in an arrangement
- The complexity and construction of many faces in arrangements of lines and of segments
- The complexity of cells in three-dimensional arrangements
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces
- Triangles in space or building (and analyzing) castles in the air
- \(\epsilon\)-nets and simplex range queries
Cited in
(29)- On the sum of squares of cell complexities in hyperplane arrangements
- Two theorems on point-flat incidences
- On a Question of Bourgain about Geometric Incidences
- The exact fitting problem in higher dimensions
- On the Minkowski distances and products of sum sets
- Lines in space: Combinatorics and algorithms
- Many-face complexity in incremental convex arrangements
- The complexity and construction of many faces in arrangements of lines and of segments
- The Clarkson–Shor Technique Revisited and Extended
- Classification of arrangements by the number of their cells
- New results for the growth of sets of real numbers
- scientific article; zbMATH DE number 4151859 (Why is no real title available?)
- Castles in the air revisited
- New lower bounds for Hopcroft's problem
- Counting facets and incidences
- The complexity of cells in three-dimensional arrangements
- Enumerating colorings, tensions and flows in cell complexes
- Depth in an arrangement of hyperplanes
- A semi-algebraic version of Zarankiewicz's problem
- Triangles in space or building (and analyzing) castles in the air
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- On joints in arrangements of lines in space and related problems
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- The Szemerédi-Trotter theorem in the complex plane
- On the number of incidences between points and planes in three dimensions
- Combinatorial complexity bounds for arrangements of curves and spheres
- A bichromatic incidence bound and an application
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
- A note on visibility-constrained Voronoi diagrams
This page was built for publication: The complexity of many cells in arrangements of planes and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582901)
