Optimal partition trees (Q420575): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00454-012-9410-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4253015087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On range searching with semialgebraic sets / 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: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient searching with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913806 / 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: Decomposable searching problems I. Static-to-dynamic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Output-sensitive results on convex hulls, extreme points, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams / 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: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex range reporting on a pointer machine / 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: Quasi-optimal upper bounds for simplex range searching and new zone theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Closest-Point Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas algorithms for linear and integer programming when the dimension is small / 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: CUTTINGS AND APPLICATIONS / 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: Implicitly representing arrangements of lines or segments / 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 Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with low crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting points in halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Optimization Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range searching with efficient hierarchical cuttings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ray shooting in convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming queries revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Space for Range Queries / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Optimal partition trees
scientific article

    Statements

    Optimal partition trees (English)
    0 references
    0 references
    22 May 2012
    0 references
    simplex range searching
    0 references
    halfspace range searching
    0 references
    geometric data structures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references