
doi: 10.1007/bf02189317
For a collection of \(n\) hyperplanes in \(\mathbb{R}^ d\) the complex of all open cells and their lower dimensional faces is called an arrangement. The collection of all those cells which are met by a set \(\sigma\) is called its zone and its complexity is the number of all the faces. Asymptotic estimates for the complexity are given the simplest, for the case that \(\sigma\) is the boundary of a convex set or an algebraic surface, is \(O(n^{d-1}\log n)\).
510.mathematics, Computer graphics; computational geometry (digital and algorithmic aspects), zone theorem, algebraic surface, hyperplane arrangement, Article, Arrangements of points, flats, hyperplanes (aspects of discrete geometry), Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
510.mathematics, Computer graphics; computational geometry (digital and algorithmic aspects), zone theorem, algebraic surface, hyperplane arrangement, Article, Arrangements of points, flats, hyperplanes (aspects of discrete geometry), Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
