On the combinatorial complexity of approximating polytopes (Q1688856): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximating extent measures of points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Volume of Strictly Convex Bodies with many Boundary Lattice Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of corners on the complexity of approximate range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal area-sensitive bounds for polytope approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate polytope membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for halfspace range searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic volumes and f-vectors of random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex bodies, economic cap coverings, random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of general smooth convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is half-space range searching? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of convex sets by polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of convex sets by polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polytope covering and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building triangulations using ε-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of random geometric structures made simpler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric entropy of some classes of sets with differentiable boundaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directions of the line segments and of the <i>r</i> ‐dimensional balls on the boundary of a convex body in Euclidean space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by polygons and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic estimates for best and stepwise approximation of convex bodies II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3010463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on non-homogeneous lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation and approximation of polyhedral objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral approximation of smooth convex bodies / rank
 
Normal rank

Latest revision as of 22:24, 14 July 2024

scientific article
Language Label Description Also known as
English
On the combinatorial complexity of approximating polytopes
scientific article

    Statements

    On the combinatorial complexity of approximating polytopes (English)
    0 references
    0 references
    0 references
    11 January 2018
    0 references
    convex polytopes
    0 references
    polytope approximation
    0 references
    combinatorial complexity
    0 references
    macbeath regions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers