On the zone of a surface in a hyperplane arrangement (Q1209841): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On range searching with semialgebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of squares of cell complexities in hyperplane arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Castles in the air revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient ray shooting and hidden surface removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Zone Theorem for Hyperplane Arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Betti Numbers of Real Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037404 / rank
 
Normal rank

Latest revision as of 16:44, 17 May 2024

scientific article
Language Label Description Also known as
English
On the zone of a surface in a hyperplane arrangement
scientific article

    Statements

    On the zone of a surface in a hyperplane arrangement (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    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)\).
    0 references
    0 references
    0 references
    0 references
    0 references
    hyperplane arrangement
    0 references
    zone theorem
    0 references
    algebraic surface
    0 references
    0 references