How hard is half-space range searching? (Q685178): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/dcg/BronnimannCP93, #quickstatements; #temporary_batch_1731468600454
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Bernard Chazelle / rank
Normal rank
 
Property / author
 
Property / author: Bernard Chazelle / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q29394177 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a new space-partitioning technique / 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: Inherent complexity trade-offs for range query problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Complexity of Polytope Range Searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: I. The reporting case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for orthogonal range searching: part II. The arithmetic model / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the complexity of simplex range reporting on a pointer machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-optimal range searching in spaces of finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric retrieval problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halfplanar range search in linear space and \(O(n^{0.695})\) query time / 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: A Lower Bound on the Complexity of Orthogonal Range Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Complexity of Some Optimal Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mean value of the volume of a random polytope in a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on non-homogeneous lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Maintaining Partial Sums / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995232397 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dcg/BronnimannCP93 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:34, 13 November 2024

scientific article
Language Label Description Also known as
English
How hard is half-space range searching?
scientific article

    Statements

    How hard is half-space range searching? (English)
    0 references
    0 references
    0 references
    0 references
    30 September 1993
    0 references
    range searching
    0 references
    lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers